1 value per node requires 1 link per value.
N values per node requires 1 link per N values.
Assuming a pointers is 4 units and a value is 1 unit:
Space for these 2 nodes: 2*(1+6*1+4*4) = 22 units.
If 1 value per node: 10*(1+4) = 50 units.
Careful: keep the nodes as full as possible.