Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056571
%S A056571 0,1,1,16,81,625,4096,28561,194481,1336336,9150625,62742241,429981696,
%T A056571 2947295521,20200652641,138458410000,949005240561,6504586067281,
%U A056571 44583076827136,305577005139121,2094455819300625,14355614096087056
%N A056571 Fourth power of Fibonacci numbers A000045.
%D A056571 A. Brousseau, A sequence of power formulas, Fib. Quart., 6 (1968), 81-83.
%D A056571 D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, 
               MA, 1969, Vol. 1, p. 85, (exercise 1.2.8. Nr. 30) and p. 492 (solution).
%D A056571 J. Riordan, Generating functions for powers of Fibonacci numbers, Duke. 
               Math. J. 29 (1962) 5-1.
%D A056571 A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of 
               combinatorial proof, M.A.A. 2003, id. 31.
%F A056571 a(n)= F(n)^4, F(n)=A000045(n).
%F A056571 G.f.: x*p(4, x)/q(4, x) with p(4, x) := sum(A056588(3, m)*x^m, m=0..3)= 
               1-4*x-4*x^2+x^3 = (1+x)*(1-5*x+x^2) and q(4, x) := sum(A055870(5, 
               m)*x^m, m=0..5)= 1-5*x-15*x^2+15*x^3+5*x^4-x^5 = (1-x)*(1+3*x+x^2)*(1-7*x+x^2) 
               (denominator factorization deduced from Riordan result).
%F A056571 Recursion (cf. Knuth's exercise): 1*a(n)-5*a(n-1)-15*a(n-2)+15*a(n-3)+5*a(n-4)-1*a(n-5) 
               = 0, n >= 5; inputs: a(n), n=0..4.
%F A056571 (1/25){(-1)^n[2F(2n-2)-6F(2n+1)] + 2F(4n-1) + F(4n) + 6}. - R. Stephan, 
               May 14 2004
%F A056571 F(n-2)*F(n-1)*F(n+1)*F(n+2) + 1.
%F A056571 Sum_(j=0..n) binomial(n,j) a(j)= [3^n A005248(n)-4*(-1)^n*A000032(n)+6*2^n]/
               25. sum_(j=0..n) (-1)^j binomial(n,j) a(j)= -5^[(n+1)/2-2] [A001906(n)+4 
               A000045(n)] if n odd. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Oct 16 2006
%p A056571 with (combinat):seq(mul(fibonacci(n), k=1..4), n=0..21); - Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), Sep 21 2007
%Y A056571 Cf. A000045, A007598, A056570, A056588, A055870.
%Y A056571 First differences of A005969.
%Y A056571 Fourth row of array A103323.
%Y A056571 Sequence in context: A113849 A046453 A030514 this_sequence A053909 A151502 
               A030693
%Y A056571 Adjacent sequences: A056568 A056569 A056570 this_sequence A056572 A056573 
               A056574
%K A056571 nonn,easy
%O A056571 0,4
%A A056571 Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Jul 10 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research