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!)
 A120508 Generalized Meta-fibonacci sequence a(n) with parameters s=1 and k=4. 2
 1, 1, 2, 3, 4, 4, 4, 5, 6, 7, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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 1 <= n <= 2, a(n)=1. If 3 <= n <= 5, then a(n)=n-1. If n>5 then a(n)=a(n-1-a(n-1)) + a(n-2-a(n-2)) + a(n-3-a(n-3)) + a(n-4-a(n-4)) g.f.: A(z) = z * sum(prod(z * (1 - z^(4 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (4^i - 1) / 3. MAPLE a := proc(n) option remember; if n <= 2 then return 1 end if; if n <= 5 then return n-1 end if; return add(a(n - i - a(n - i)), i = 1 .. 4) end proc CROSSREFS Cf. A120519, A120530. Sequence in context: A135414 A326821 A099479 * A199332 A029085 A087875 Adjacent sequences:  A120505 A120506 A120507 * A120509 A120510 A120511 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 4 21:43 EDT 2020. Contains 333238 sequences. (Running on oeis4.)