A232890 Denominator of n-th term of sequence (or tree) S of all rational numbers generated by these rules: 0 is in S; if x is in S then x + 1 is in S, and if x + 1 is nonzero, then -1/(x + 1) is in S; duplicates are deleted as they occur.
1, 1, 1, 1, 2, 1, 3, 2, 1, 1, 4, 3, 2, 2, 3, 1, 5, 4, 3, 3, 5, 2, 5, 3, 1, 1, 6, 5, 4, 4, 7, 3, 8, 5, 2, 2, 7, 5, 3, 3, 4, 1, 7, 6, 5, 5, 9, 4, 11, 7, 3, 3, 11, 8, 5, 5, 7, 2, 9, 7, 5, 5, 8, 3, 7, 4, 1, 1, 8, 7, 6, 6, 11, 5, 14, 9, 4, 4, 15, 11, 7, 7, 10, 3
Offset: 1
Examples
To generate S, the number 0 begets (1,-1), whence 1 begets 2 and -1/2, whereas -1 begets 0 and -1/2, both of which are (deleted )duplicates, so that g(3) = (2, -1/2). The resulting concatenation of all the generations g(n) begins with 0, 1, -1, 2, -1/2, 3, -1/3, 1/2, -2, 4, -1/4, so that A232890 begins with 1,1,1,1,2,1,3,2,1,1,4.
Links
- Clark Kimberling, Table of n, a(n) for n = 1..1000
Programs
-
Mathematica
Off[Power::infy]; x = {0}; Do[x = DeleteDuplicates[Flatten[Transpose[{x, x + 1, -1/(x + 1)} /. ComplexInfinity -> 0]]], {8}]; x On[Power::infy]; Denominator[x] (* Peter J. C. Moses, Nov 29 2013 *)
Comments