|
|
A083104
|
|
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2).
|
|
9
|
|
|
331635635998274737472200656430763, 1510028911088401971189590305498785, 1841664547086676708661790961929548, 3351693458175078679851381267428333, 5193358005261755388513172229357881, 8545051463436834068364553496786214
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
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 Ronald Graham in 1964.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (331635635998274737472200656430763+1178393275090127233717389649068022*x)/(1-x-x^2). - Colin Barker, Jun 19 2012
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1}, {331635635998274737472200656430763, 1510028911088401971189590305498785}, 7] (* Harvey P. Dale, Oct 29 2016 *)
|
|
PROG
|
(PARI) a(n)=331635635998274737472200656430763*fibonacci(n-1)+ 1510028911088401971189590305498785*fibonacci(n) \\ Charles R Greathouse IV, Dec 18 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|