login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120520 a(n) = min{j : A120509(j) = n}. 2
1, 4, 5, 6, 10, 11, 12, 13, 15, 16, 17, 18, 20, 21, 22, 23, 28, 29, 30, 31, 33, 34, 35, 36, 38, 39, 40, 41, 43, 44, 45, 46, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 62, 64, 65, 66, 67, 70, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

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^4) * (2 + 1 / (1 - z^(m^4))), 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 A120509(j) = n then return j; fi; od;

end proc;

CROSSREFS

Cf. A120509, A120531.

Sequence in context: A169889 A144022 A028280 * A213523 A246441 A026312

Adjacent sequences:  A120517 A120518 A120519 * A120521 A120522 A120523

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:45 EDT 2020. Contains 333079 sequences. (Running on oeis4.)