|
| |
|
|
A056914
|
|
a(n)=L(4n+1) where L() are the Lucas numbers.
|
|
3
| |
|
|
1, 11, 76, 521, 3571, 24476, 167761, 1149851, 7881196, 54018521, 370248451, 2537720636, 17393796001, 119218851371, 817138163596, 5600748293801, 38388099893011, 263115950957276, 1803423556807921, 12360848946698171
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| V. E. Hoggatt, Jr., Fibonacci and Lucas Numbers, A Publication of the Fibonacci Association, Houghton Mifflin Co., 1969, pps. 27-29.
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n)=7a(n-1)-a(n-2); a(0)=1, a(1)=11.
G.f.: (1-4*x)/(1-7*x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 02 2008]
|
|
|
EXAMPLE
| a(n)={11*[((7+3*sqrt(5))/2)^n - ((7-3*sqrt(5))/2)^n]-[((7+3*sqrt(5))/2)^(n-1) - ((7-3*sqrt(5))/2)^(n-1)]}/3*sqrt(5).
|
|
|
CROSSREFS
| Cf. (A056914)=sqrt{5*(A033889)^2-4}.
Sequence in context: A036427 A122589 A034269 * A039674 A059625 A023010
Adjacent sequences: A056911 A056912 A056913 * A056915 A056916 A056917
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Barry E. Williams, Jul 11 2000
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 13 2000
|
| |
|
|
