%I A005970 M4689
%S A005970 1,10,26,75,196,520,1361,3570,9346,24475,64076,167760,439201,1149850,
%T A005970 3010346,7881195,20633236,54018520,141422321,370248450,969323026,
%U A005970 2537720635,6643838876,17393796000,45537549121,119218851370
%N A005970 Sum of squares of Lucas numbers.
%D A005970 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A005970 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 A005970 A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci
Association, San Jose, CA, 1972, p. 20.
%H A005970 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 A005970 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 A005970 G.f.: [1+7x-4x^2]/[(1-x)(1+x)(1-3x+x^2)]. - Ralf Stephan, Apr 23 2004
%p A005970 lucas := proc(n) option remember: if n=1 then RETURN(1) fi: if n=2 then
RETURN(3) fi: lucas(n-1)+lucas(n-2) end: l[0] := 0: for i from 1
to 50 do l[i] := l[i-1]+lucas(i)^2; printf(`%d,`,l[i]) od:
%p A005970 A005970:=(-1-7*z+4*z**2)/(z-1)/(z+1)/(z**2-3*z+1); [Conjectured by S.
Plouffe in his 1992 dissertation.]
%Y A005970 Sequence in context: A134420 A144255 A072379 this_sequence A051966 A092774
A024168
%Y A005970 Adjacent sequences: A005967 A005968 A005969 this_sequence A005971 A005972
A005973
%K A005970 nonn,easy
%O A005970 1,2
%A A005970 N. J. A. Sloane (njas(AT)research.att.com).
%E A005970 More terms and Maple program from James A. Sellers (sellersj(AT)math.psu.edu),
May 29 2000
|