|
|
A082411
|
|
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2).
|
|
8
|
|
|
407389224418, 76343678551, 483732902969, 560076581520, 1043809484489, 1603886066009, 2647695550498, 4251581616507, 6899277167005, 11150858783512, 18050135950517, 29200994734029, 47251130684546, 76452125418575, 123703256103121, 200155381521696, 323858637624817
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(0) = 407389224418, a(1) = 76343678551. This is a second-order linear recurrence sequence with a(0) and a(1) coprime that does not contain any primes. It was found by John Nicol in 1999.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (407389224418-331045545867*x)/(1-x-x^2). [Colin Barker, Jun 19 2012]
|
|
MAPLE
|
a:= n-> (<<0|1>, <1|1>>^n. <<407389224418, 76343678551>>)[1, 1]:
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1}, {407389224418, 76343678551}, 25] (* Paolo Xausa, Nov 07 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|