|
|
A083216
|
|
Fibonacci-like sequence of composite numbers with a(0) = 20615674205555510, a(1) = 3794765361567513.
|
|
11
|
|
|
20615674205555510, 3794765361567513, 24410439567123023, 28205204928690536, 52615644495813559, 80820849424504095, 133436493920317654, 214257343344821749, 347693837265139403, 561951180609961152, 909645017875100555, 1471596198485061707, 2381241216360162262
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(0) = 20615674205555510, a(1) = 3794765361567513. 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 Herbert S. Wilf in 1990.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) + a(n-2) for n>1.
G.f.: (20615674205555510-16820908843987997*x)/(1-x-x^2).
|
|
MAPLE
|
a:= n-> (<<0|1>, <1|1>>^n. <<20615674205555510, 3794765361567513>>)[1, 1]:
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1}, {20615674205555510, 3794765361567513}, 25] (* Paolo Xausa, Nov 07 2023 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|