login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120514 a(n) = min{j : A120503(j) = n}. 3
1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19, 20, 22, 23, 24, 27, 28, 29, 31, 32, 33, 35, 36, 37, 41, 42, 43, 45, 46, 47, 49, 50, 51, 54, 55, 56, 58, 59, 60, 62, 63, 64, 67, 68, 69, 71, 72, 73, 75, 76, 77, 81, 82, 83, 85, 86, 87, 89, 90, 91, 94, 95, 96, 98 (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]
FORMULA
G.f.: P(z) = z / (1-z) * (1 + Sum_{m>=0} z^(m^3)/(1 - z^(m^3))).
a(1) = 1; a(n) = n-1 + a(floor((n-1)/3)+1). - Gleb Ivanov, Jan 10 2022
MAPLE
p := proc(n)
if n=1 then return 1; end if;
for j from p(n-1)+1 to infinity do
if A120503(j) = n then return j; fi; od;
end proc;
CROSSREFS
Sequence in context: A325113 A328393 A189529 * A101886 A284509 A135674
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)