This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120505 Generalized Meta-fibonacci sequence a(n) with parameters s=2 and k=3. 3
 1, 1, 1, 2, 3, 3, 3, 3, 4, 5, 6, 6, 7, 8, 9, 9, 9, 9, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 18, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 27, 27, 27, 27, 27, 27, 28, 29, 30, 30, 31, 32, 33, 33, 34, 35, 36, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 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 <= 3, a(n)=1. If 4 <= n <= 5, then a(n)=n-2. If n>5 then a(n)=a(n-2-a(n-1)) + a(n-3-a(n-2)) + a(n-4-a(n-3)) g.f.: A(z) = z * (1 - z^2) / (1 - z) * sum(prod(z^2 * (1 - z^(3 * [i])) / (1 - z^[i]), i=1..n), n=0..infinity), where [i] = (3^i - 1) / 2. MAPLE a := proc(n) option remember; if n <= 3 then return 1 end if; if n <= 5 then return n-2 end if; return add(a(n - i - 1 - a(n - i)), i = 1 .. 3) end proc CROSSREFS Cf. A120516, A120527. Sequence in context: A176001 A194272 A025776 * A029109 A029090 A029089 Adjacent sequences:  A120502 A120503 A120504 * A120506 A120507 A120508 KEYWORD nonn AUTHOR Frank Ruskey (http://www.cs.uvic.ca/~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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .