This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A274163 #20 Aug 30 2018 15:50:50 %S A274163 1,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6766, %T A274163 10948,17716,28667,46388,75063 %N A274163 Number of real integers in n-th generation of tree T(4i) defined in Comments. %C A274163 Let T* be the infinite tree with root 0 generated by these rules: if p is in T*, then p+1 is in T* and x*p is in T*. Let g(n) be the set of nodes in the n-th generation, so that g(0) = {0}, g(1) = {1}, g(2) = {2,x}, g(3) = {3,2x,x+1,x^2}, etc. Let T(r) be the tree obtained by substituting r for x. %C A274163 For each integer k > 0, let s(k,n) be the number of integers in the n-th generation of T(k*i). Conjecture: there is a limiting sequence S(n) as k increases, and S(n) = F(n) for n >= 1, where F = A000045 (Fibonacci numbers). %C A274163 From _Charlie Neder_, Jul 11 2018: (Start) %C A274163 Assume for the moment that a complex number cannot be transformed back into an integer. If this is the case, then the real integers in g(n) are the real integers in g(n-1) plus 1 and the imaginary integers in g(n-1) times k*i, which are themselves k*i times the real integers in g(n-2), and so S(n) = S(n-1) + S(n-2) and S(n) = F(n). %C A274163 However, the above assumption is false, but the earliest time such a transformation can take place is at g(k^2+5), following this path: 0 -> 1 -> k*i -> 1+k*i -> -k^2+k*i -> -(k^2-1)+k*i -> ... -> k*i -> -k^2. %C A274163 Therefore s(k,n) matches the Fibonacci sequence for n < k^2+5 and S(n) = F(n). (End) %C A274163 a(n) = A000045(n) only for 0 < n < 21. - _Robert G. Wilson v_, Jul 23 2018 %e A274163 If r = 4i, then g(3) = {3,2r,r+1, r^2}, in which the number of real integers is a(3) = 2. %t A274163 z = 18; t = Join[{{0}}, Expand[NestList[DeleteDuplicates[Flatten[Map[{# + 1, x*#} &, #], 1]] &, {1}, z]]]; %t A274163 u = Table[t[[k]] /. x -> 4 I, {k, 1, z}]; Table[Count[Map[IntegerQ, u[[k]]], True], {k, 1, z}] %Y A274163 See A274142 for a guide to related sequences. %K A274163 nonn,more %O A274163 0,4 %A A274163 _Clark Kimberling_, Jun 12 2016 %E A274163 a(21)-a(25) from _Robert G. Wilson v_, Jul 23 2018