OFFSET
0,3
COMMENTS
Every integer occur in T exactly once, so that this is a permutation of the integers. Let g(0) = {0}, g(1) = {1}, g(2) = {-2,2}, g(3) = {-4,-1,3,4}, etc. The number |g(n)| of numbers in the n-th generation is a Fibonacci number except for g(3); see A264800.
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..10000
EXAMPLE
Generations begin with
0
1
-2 2
-4 -1 3 4
-8 -6 -3 5 8
-16 -10 -7 -5 6 9 12 16
MATHEMATICA
CROSSREFS
KEYWORD
sign,tabf,easy
AUTHOR
Clark Kimberling, Nov 25 2015
STATUS
approved