Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120521
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A120521
%S A120521 1,5,6,7,12,13,14,15,17,18,19,20,22,23,24,25,31,32,33,34,36,37,38,39,41,
%T A120521 42,43,44,46,47,48,49,52,53,54,55,57,58,59,60,62,63,64,65,67,68,69,70,
%U A120521 73,74
%N A120521 a(n) = min{j : A120510(j) = n}.
%H A120521 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 A120521 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 A120521 g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^4) * (3 + 1 / (1 - z^(m^4))), 
               m=0..infinity))
%p A120521 p := proc(n)
%p A120521 if n=1 then return 1; end if;
%p A120521 for j from p(n-1)+1 to infinity do
%p A120521 if A120510(j) = n then return j; fi; od;
%p A120521 end proc;
%Y A120521 Cf. A120510, A120532.
%Y A120521 Sequence in context: A028318 A154952 A037360 this_sequence A022566 A047320 
               A011761
%Y A120521 Adjacent sequences: A120518 A120519 A120520 this_sequence A120522 A120523 
               A120524
%K A120521 nonn
%O A120521 1,2
%A A120521 Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), 
               Jun 20 2006

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research