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.
This sequence was found using Knuth's method.
LINKS
R. L. Graham, A Fibonacci-Like sequence of composite numbers, Math. Mag., Vol. 37, No. 5 (1964), pp. 322-324.
Donald E. Knuth, A Fibonacci-Like sequence of composite numbers, Math. Mag., Vol. 63, No. 1 (1990), pp. 21-25.
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(n) = a(n-1) + a(n-2).
MAPLE
a:= n-> (<<0|1>, <1|1>>^n. <<759135467284, 74074527465>>)[1, 1]:
seq(a(n), n=0..16); # Alois P. Heinz, Oct 06 2021
MATHEMATICA
LinearRecurrence[{1, 1}, {759135467284, 74074527465}, 17] (* Amiram Eldar, Oct 07 2021 *)
PROG
(PARI) a(n)=759135467284*fibonacci(n-1)+ 74074527465*fibonacci(n)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Chittaranjan Pardeshi, Oct 06 2021
STATUS
approved