|
| |
|
|
A120512
|
|
a(n) = min{j : A120501(j) = n}.
|
|
2
| |
|
|
1, 4, 8, 9, 14, 15, 17, 18, 24, 25, 27, 28, 31, 32, 34, 35, 42, 43, 45, 46, 49, 50, 52, 53, 57, 58, 60, 61, 64, 65, 67, 68, 76, 77, 79, 80, 83, 84, 86, 87, 91, 92, 94, 95, 98, 99, 101, 102, 107, 108
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| B. Jackson and F. Ruskey, Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages.
|
|
|
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
| g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^2) * (2 + 1 / (1 - z^(m^2))), m=0..infinity))
|
|
|
MAPLE
| p := proc(n)
if n=1 then return 1; end if;
for j from p(n-1)+1 to infinity do
if A120501(j) = n then return j; fi; od;
end proc;
|
|
|
CROSSREFS
| Cf. A120501, A120523.
Sequence in context: A134376 A163408 A060299 * A046954 A112775 A107747
Adjacent sequences: A120509 A120510 A120511 * A120513 A120514 A120515
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006
|
| |
|
|
