ards to the number before the start number...
i.e. 9, 0, 1, 2, 3, 4, 5, 6, 7, 8
then it will need to repeat this pattern (continuing to count upwards) and the repeat number is based on a slider (for example 3 in the case illustrated below):
9, 0, 1, 2, 3, 4, 5, 6, 7, 8
19, 10, 11, 12, 13, 14, 15, 16, 17, 18,
29, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
if anyone has any ideas on how to create this series it would be great
M.…
5 8, and then the following values are obtain as the last one (8) plus 3, then this last one (11) plus 5, and then this last one (16) plus 8, and then it starts again: 24+3, 27+5, 32+8...
Thanks
…
Added by Jesus Galvez at 5:17am on November 27, 2012
etting when I merge the three trees, but what I would like to get is:
essentially a tree with 27 branches, each with a single list of either 11 or 21 points.
{0} (N=11)
{1} (N=11)
...
{10} (N=21)
{11} (N=21)
...
{17} (N=11)
{18) (N=11)
{27} (N=11)
Any help would be greatly appreciated.
All the best,
Matt
…
Added by Matt Schmid at 3:06pm on December 4, 2010