This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082411 Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2). 5


%S 407389224418,76343678551,483732902969,560076581520,1043809484489,

%T 1603886066009,2647695550498,4251581616507,6899277167005,

%U 11150858783512,18050135950517,29200994734029,47251130684546,76452125418575,123703256103121,200155381521696,323858637624817

%N Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2).

%C a(0) = 407389224418, a(1) = 76343678551. 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 John Nicol in 1999.

%H Alois P. Heinz, <a href="/A082411/b082411.txt">Table of n, a(n) for n = 0..1000</a>

%H Arturas Dubickas, Aivaras Novikas, Jonas Šiurys, <a href="http://dx.doi.org/10.1016/j.jnt.2010.03.015">A binary linear recurrence sequence of composite numbers</a>, Journal of Number Theory, Volume 130, Issue 8, August 2010, Pages 1737-1749.

%H R. L. Graham, <a href="http://www.jstor.org/stable/2689243">A Fibonacci-Like sequence of composite numbers</a>, Math. Mag. 37 (1964) 322-324.

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H D. E. Knuth, <a href="http://www.jstor.org/stable/2691504">A Fibonacci-Like sequence of composite numbers</a>, Math. Mag. 63 (1) (1990) 21-25

%H J. W. Nicol, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v6i1r44">A Fibonacci-like sequence of composite numbers</a>, The Electronic Journal of Combinatorics, Volume 6 (1999), Research Paper #R44.

%H Herbert S. Wilf, <a href="http://www.jstor.org/stable/2690956">Letters to the Editor</a> Math. Mag. 63, 284, 1990.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).

%F G.f.: (407389224418-331045545867*x)/(1-x-x^2). [_Colin Barker_, Jun 19 2012]

%p a:= n-> (<<0|1>, <1|1>>^n. <<407389224418, 76343678551>>)[1, 1]:

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Apr 04 2013

%Y Cf. A000032 (Lucas numbers), A000045 (Fibonacci numbers), A083103, A083104, A083105, A083216.

%K nonn,easy

%O 0,1

%A _Harry J. Smith_, Apr 23 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 23:55 EST 2016. Contains 278902 sequences.