

A274144


Number of integers in nth generation of tree T(1/4) defined in Comments.


2



1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 5, 8, 8, 9, 12, 16, 17, 21, 27, 32, 37, 47, 57, 67, 82, 102, 121, 145, 180, 219, 260, 317, 391, 470, 564, 691, 843, 1012, 1225, 1500, 1816, 2188, 2663, 3245, 3918, 4744, 5778, 7010, 8473, 10291, 12511, 15148
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,6


COMMENTS

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 nth 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.
See A274142 for a guide to related sequences.


LINKS



EXAMPLE

For r = 1/4, we have g(3) = {3,2r,r+1, r^2}, in which only 3 is an integer, so that a(3) = 1.


MATHEMATICA

z = 18; t = Join[{{0}}, Expand[NestList[DeleteDuplicates[Flatten[Map[{# + 1, x*#} &, #], 1]] &, {1}, z]]];
u = Table[t[[k]] /. x > 1/4, {k, 1, z}];
Table[Count[Map[IntegerQ, u[[k]]], True], {k, 1, z}]


CROSSREFS



KEYWORD

nonn,easy


AUTHOR



EXTENSIONS



STATUS

approved



