The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120507 Generalized Meta-fibonacci sequence a(n) with parameters s=0 and k=4. 4
 1, 2, 3, 4, 4, 5, 6, 7, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 16, 16, 17, 18, 19, 20, 20, 21, 22, 23, 24, 24, 25, 26, 27, 28, 28, 29, 30, 31, 32, 32, 32, 33, 34, 35, 36, 36, 37, 38, 39, 40, 40, 41, 42, 43, 44, 44, 45, 46, 47 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link] C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences FORMULA If n=1, a(n)=1. If 2 <= n <= 4, then a(n)=n. If n>4 then a(n)=a(n-a(n-1)) + a(n-1-a(n-2)) + a(n-2-a(n-3)) + a(n-3-a(n-4)) g.f.: A(z) = z / (1 - z) * prod((1 - z^(4 * [i])) / (1 - z^[i])), i=1..infinity), where [i] = (4^i - 1) / 3. MAPLE a := proc(n) option remember; if n <= 1 then return 1 end if; if n <= 4 then return n end if; return add(a(n - i + 1 - a(n - i)), i = 1 .. 4) end proc CROSSREFS Cf. A120518, A120529. Sequence in context: A053756 A210436 A003004 * A303787 A090223 A171974 Adjacent sequences:  A120504 A120505 A120506 * A120508 A120509 A120510 KEYWORD nonn AUTHOR Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006 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 April 2 19:05 EDT 2020. Contains 333190 sequences. (Running on oeis4.)