This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244860 Number of Fibonacci numbers in generation n of the tree at A232559. 0
 1, 1, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 1, 1, 1, 0, 3, 0, 1, 1, 1, 2, 0, 0, 2, 0, 1, 1, 1, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Generation n consists of F(n) = A000045(n) distinct Fibonacci numbers.  Is {a(n)} bounded above? LINKS EXAMPLE In the table below, g(n) denotes generation n of the tree at A232559. n ... g(n) ............ a(n) 1 ... {1} ............. 1 2 ... {2} ............. 1 3 ... {3,4} ........... 1 4 ... {5,6,8} ......... 2 5 ... {7,9,10,12,16} .. 0 MATHEMATICA z = 32; g[1] = {1}; f1[x_] := f1[x] = x + 1; f2[x_] := f2[x] = 2 x; h[1] = g[1]; b[n_] := b[n] = DeleteDuplicates[Union[f1[g[n - 1]], f2[g[n - 1]]]]; h[n_] := h[n] = Union[h[n - 1], g[n - 1]]; g[n_] := g[n] = Complement [b[n], Intersection[b[n], h[n]]]; f = Table[Fibonacci[n], {n, 1, 90}]; Table[Length[Intersection[g[n], f]], {n, 1, z}] CROSSREFS Cf. A232559, A000045. Sequence in context: A166124 A134979 A112248 * A308009 A010872 A220663 Adjacent sequences:  A244857 A244858 A244859 * A244861 A244862 A244863 KEYWORD nonn,more AUTHOR Clark Kimberling, Jul 07 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 16 08:50 EDT 2019. Contains 328056 sequences. (Running on oeis4.)