|
|
A053573
|
|
a(n) = 5*a(n-1) + 14*a(n-2), a(0)=1, a(1)=5.
|
|
4
|
|
|
1, 5, 39, 265, 1871, 13065, 91519, 640505, 4483791, 31386025, 219703199, 1537920345, 10765446511, 75358117385, 527506838079, 3692547833785, 25847834902031, 180934844183145, 1266543909544159, 8865807366284825, 62060651565042351
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
F. P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, March 2014; Preprint on ResearchGate.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (7^(n+1) - (-2)^(n+1))/9.
a(n) = 5*a(n-1) + 14*a(n-2), with a(0)=1, a(1)=5.
E.g.f.: (7*exp(7*x) - 2*exp(-2*x))/9. - G. C. Greubel, May 16 2019
|
|
MATHEMATICA
|
LinearRecurrence[{5, 14}, {1, 5}, 30] (* Harvey P. Dale, May 29 2017 *)
|
|
PROG
|
(Sage) [lucas_number1(n, 5, -14) for n in range(1, 16)] # Zerinvary Lajos, Apr 24 2009
(Magma) [(7^(n+1) -(-2)^(n+1))/9: n in [0..30]]; // G. C. Greubel, May 16 2019
(GAP) List([0..30], n-> (7^(n+1) -(-2)^(n+1))/9) # G. C. Greubel, May 16 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|