|
Search: id:A099867
|
|
|
| A099867 |
|
a(n) = 5a(n - 1) - a(n - 2), a(0) = 1, a(1) = 9. |
|
+0
2
|
|
| 1, 9, 44, 211, 1011, 4844, 23209, 111201, 532796, 2552779, 12231099, 58602716, 280782481, 1345309689, 6445765964, 30883520131, 147971834691, 708975653324, 3396906431929, 16275556506321, 77980876099676, 373628823992059
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. F. Horadam, Pell Identities, Fib. Quart., Vol. 9, No. 3, 1971, pps. 245-252.
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
|2*a(n) + A099868(n) - A003501(n+1)| = 20*A004254(n)
G.f.: (1+4x)/(1-5x+x^2). a(n) = A004254(n+1)+4*A004254(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 2008]
|
|
MATHEMATICA
|
a[0] = 1; a[1] = 9; a[n_] := a[n] = 5a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 21}] (from Robert G. Wilson v Dec 14 2004)
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP
|
|
CROSSREFS
|
Cf. A099868, A003501, A004254.
Sequence in context: A084903 A034558 A144109 this_sequence A104470 A084016 A125679
Adjacent sequences: A099864 A099865 A099866 this_sequence A099868 A099869 A099870
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Oct 28 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 14 2004
|
|
|
Search completed in 0.002 seconds
|
