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!)
A120516 a(n) = min{j : A120505(j) = n}. 2

%I #4 Aug 21 2013 12:09:46

%S 1,4,5,9,10,11,13,14,15,20,21,22,24,25,26,28,29,30,33,34,35,37,38,39,

%T 41,42,43,49,50,51,53,54,55,57,58,59,62,63,64,66,67,68,70,71,72,75,76,

%U 77,79,80

%N a(n) = min{j : A120505(j) = n}.

%H C. Deugau and F. Ruskey, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL12/Ruskey/ruskey6.pdf">Complete k-ary Trees and Generalized Meta-Fibonacci Sequences</a>, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link]

%H C. Deugau and F. Ruskey, <a href="http://www.cs.uvic.ca/~ruskey/Publications/MetaFib/GenMetaFib.html">Complete k-ary Trees and Generalized Meta-Fibonacci Sequences</a>

%F g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^3) * (2 + 1 / (1 - z^(m^3))), m=0..infinity))

%p p := proc(n)

%p if n=1 then return 1; end if;

%p for j from p(n-1)+1 to infinity do

%p if A120505(j) = n then return j; fi; od;

%p end proc;

%Y Cf. A120505, A120527.

%K nonn

%O 1,2

%A _Frank Ruskey_ and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006

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 April 19 14:04 EDT 2024. Contains 371792 sequences. (Running on oeis4.)