Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000288
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A000288 M3307 N1332
%S A000288 1,1,1,1,4,7,13,25,49,94,181,349,673,1297,2500,4819,9289,17905,34513,
%T A000288 66526,128233,247177,476449,918385,1770244,3412255,6577333,12678217,
%U A000288 24438049,47105854,90799453,175021573,337364929,650291809,1253477764
%N A000288 Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) +a(n-4).
%D A000288 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A000288 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000288 S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques 
               Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%D A000288 B. G. Baumgart, Letter to the editor, Fib. Quart. 2 (1964), 260, 302.
%D A000288 W. C. Lynch, The t-Fibonacci numbers and polyphase sorting, Fib. Quart., 
               8 (1970), pp. 6ff.
%H A000288 T. D. Noe, <a href="b000288.txt">Table of n, a(n) for n=0..200</a>
%H A000288 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Fxtbook</a>
%H A000288 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">
               Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures</
               a>, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%H A000288 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">
               1031 Generating Functions and Conjectures</a>, Universit\'{e} du 
               Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
%F A000288 [a(n), a(n+1), a(n+2), a(n+3)]' = (M^n)*[1 1 1 1]', where M = the 4 X 
               4 matrix [0 1 0 0 / 0 0 1 0 / 0 0 0 1 / 1 1 1 1]. E.g. [7 13 25 49]' 
               = (M^5)*[1 1 1 1]' = [a(5), a(6), a(7), a(8)]'. - Gary W. Adamson 
               (qntmpkt(AT)yahoo.com), Feb 22 2004. Here the prime denotes transpose.
%p A000288 A000288:=(-1+z**2+2*z**3)/(-1+z**2+z**3+z+z**4); [Conjectured by S. Plouffe 
               in his 1992 dissertation.]
%t A000288 a[0] = a[1] = a[2] = a[3] = 1; a[n_] := a[n] = a[n - 1] + a[n - 2] + 
               a[n - 3] + a[n - 4]; Table[ a[n], {n, 0, 34}] (* Robert G. Wilson 
               v *)
%Y A000288 A060455.
%Y A000288 Sequence in context: A038391 A090854 A039694 this_sequence A074863 A118334 
               A004119
%Y A000288 Adjacent sequences: A000285 A000286 A000287 this_sequence A000289 A000290 
               A000291
%K A000288 nonn
%O A000288 0,5
%A A000288 N. J. A. Sloane (njas(AT)research.att.com).
%E A000288 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 27 2005

    
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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research