login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A348204
Fibonacci-like sequence of composite numbers with a(0) = 759135467284, a(1) = 74074527465.
0
759135467284, 74074527465, 833209994749, 907284522214, 1740494516963, 2647779039177, 4388273556140, 7036052595317, 11424326151457, 18460378746774, 29884704898231, 48345083645005, 78229788543236, 126574872188241, 204804660731477, 331379532919718, 536184193651195
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.
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
STATUS
approved