|
Search: id:A073853
|
|
| |
|
| 0, 5, 9, 12, 24, 45, 60, 65, 179, 764, 1268, 5891, 16135, 29909, 71774, 173310, 200040, 1454560, 2485272, 86430343, 92439810, 115854652
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Let b(1) = b(2) = 1, b(k) = (b(k-1)+b(k-2)) (mod k); sequence gives n such that b(n) = 0.
A079777(2^31-1)=1103802855 & A079777(2^31)=2117709557.
|
|
EXAMPLE
|
b(3) = 2 (mod 3) = 2, b(4) = (2+1) (mod 4) = 3, b(5) = (3+2) (mod 5) = 0 hence a(1) = 5.
|
|
MATHEMATICA
|
a = 0; b = 1; lst = {0}; Do[c = Mod[a + b, n]; If[c == 0, AppendTo[lst, n]; Print@n]; a = b; b = c, {n, 2, 2^31}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
A079777(n)=0.
Sequence in context: A102183 A106635 A068477 this_sequence A070370 A103703 A079355
Adjacent sequences: A073850 A073851 A073852 this_sequence A073854 A073855 A073856
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 02 2002
|
|
EXTENSIONS
|
Corrected and extended by John W. Layman (layman(AT)math.vt.edu), Jun 11 2003
|
|
|
Search completed in 0.002 seconds
|
