login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049682 a(n)=(L(8n)-2)/45, where L=A000032 (the Lucas sequence). 3
0, 1, 49, 2304, 108241, 5085025, 238887936, 11222647969, 527225566609, 24768378982656, 1163586586618225, 54663801192073921, 2568035069440856064, 120642984462528161089, 5667652234669382715121, 266259012044998459449600, 12508505913880258211416081 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

This is a divisibility sequence.

LINKS

Index to divisibility sequences.

Index to sequences with linear recurrences with constant coefficients, signature (48,-48,1).

FORMULA

a(n) = (1/45)*{-2+[(47+7*sqrt(45))/2]^n+[(47-7*sqrt(45))/2]^n}. - R. Stephan, Apr 14 2004

a(n)=(A004187(n))^2 = 48*a(n-1)-48*a(n-2)+a(n-3). G.f.: -x*(1+x)/((x-1)*(x^2-47*x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 03 2009]

a(n)=F(4n)^2/9. Also a(n) - a(n-1) = A004187(2n-1). - R. K. Guy, Feb 24 2010

MATHEMATICA

LinearRecurrence[{48, -48, 1}, {0, 1, 49}, 20] (* or *) CoefficientList[Series[ (-x-x^2)/ (x^3-48x^2+48x-1), {x, 0, 20}], x] (* From Harvey P. Dale, Apr 22 2011 *)

PROG

(Mupad) numlib::fibonacci(4*n)^2/9 $ n = 0..25; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 09 2008

CROSSREFS

Sequence in context: A065785 A163927 A061615 * A162914 A163287 A163835

Adjacent sequences:  A049679 A049680 A049681 * A049683 A049684 A049685

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from N. J. A. Sloane, Feb 26 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:41 EST 2012. Contains 205860 sequences.