OFFSET
0,1
COMMENTS
A primefree linear recurrence with no common factors. As of 2004 no such sequences with smaller starting terms were known.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..4733 (terms 0..1000 from Alois P. Heinz)
Arturas Dubickas, Aivaras Novikas, and Jonas Šiurys, A binary linear recurrence sequence of composite numbers, Journal of Number Theory, Volume 130, Issue 8, August 2010, Pages 1737-1749.
D. Ismailescu and J. Son, A New Kind of Fibonacci-Like Sequence of Composite Numbers, J. Int. Seq. 17 (2014) # 14.8.2.
Maxim Vsemirnov, A new Fibonacci-like sequence of composite numbers, Journal of Integer Sequences 7:3 (2004).
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(n) = a(n-1) + a(n-2).
G.f.: (106276436867-71020044435*x)/(1-x-x^2).
MAPLE
a:= n-> (<<0|1>, <1|1>>^n. <<106276436867, 35256392432>>)[1, 1]:
seq(a(n), n=0..20); # Alois P. Heinz, Apr 04 2013
MATHEMATICA
LinearRecurrence[{1, 1}, {106276436867, 35256392432}, 20] (* Alonso del Arte, Feb 05 2013 *)
PROG
(PARI) Vec((106276436867-71020044435*x)/(1-x-x^2)+O(x^30)) \\ Charles R Greathouse IV, Dec 09 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Charles R Greathouse IV, Feb 05 2013
EXTENSIONS
Offset corrected by Alois P. Heinz, Apr 04 2013
STATUS
approved