Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A049668
%S A049668 0,1,47,2208,103729,4873055,228929856,10754830177,505248088463,
%T A049668 23735905327584,1115082302307985,52385132303147711,2460986135945634432,
%U A049668 115613963257141670593,5431395286949712883439,255159964523379363851040
%N A049668 a(n)=F(8n)/21, where F=A000045 (the Fibonacci sequence).
%H A049668 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A049668 G.f. x/(1-47*x+x^2), 47=L(8)=A000032(8) (Lucas).
%F A049668 a(n)=47*a(n-1)-a(n-2) ; a(0)=0, a(1)=1. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 18 2008]
%o A049668 (Mupad) numlib::fibonacci(8*n)/21 $ n = 0..25; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               May 09 2008
%Y A049668 A column of array A028412.
%Y A049668 Sequence in context: A153214 A142845 A014941 this_sequence A009991 A052463 
               A005148
%Y A049668 Adjacent sequences: A049665 A049666 A049667 this_sequence A049669 A049670 
               A049671
%K A049668 nonn
%O A049668 0,3
%A A049668 Clark Kimberling (ck6(AT)evansville.edu)
%E A049668 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 20 2000

    
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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research