|
Search: id:A131401
|
|
| |
|
| 1, 0, 2, 3, 5, 4, 13, 7, 17, 11, 89, 6, 233, 29, 10, 47, 1597, 19, 37, 15, 26, 199, 28657, 14, 25, 521, 53, 39, 514229, 20, 557, 2207, 178, 3571, 65, 27, 73, 9349, 466, 35, 2789, 52
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Conjecture: only a(2)=0. I have not found values of a(k)<2*106 less than 100 for k = 43, 47, 74, 82, 83 & 94.
a(43)>20000000. The sequence continues: 43, 85, 139, (47)>2*10^7, 64, 97, 101, 3194, 699, 953, 212, 445, 49, 74, 59, 353, 30, 4513, 3010349, 221, 1087, 1165, 356, 269, 67, 137, 71, 6673, 119, 9375829, a(74)>2*10^7, 50, 111, 1157, 79, 157, 235, 2269, a(82)>2*10^7, a(83)>2*10^7, 78, 7985, 6709, 173, 263, 1069, 95, 169, 417, 1114, a(94)>2*10^7, 185, 128, 193, 2813, 197, 75, ...,
|
|
REFERENCES
|
Alfred S. Posamentier & Ingmar Lehmann, The (Fabulous) Fibonacci Numbers, Afterword by Herbert A. Hauptman, 2. 'The Minor Modulus m(n)', Prometheus Books, NY, 2007, page 329-342.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[Mod[Fibonacci@k, n] != 0 && k < 101, k++ ]; k]; t = Table[0, {100}]; Do[ a = f@n; If[a < 101 && t[[a]] == 0, t[[a]] = n; Print[{a, n}]], {n, 106}]
|
|
CROSSREFS
|
Sequence in context: A023395 A101428 A101409 this_sequence A061446 A107476 A094140
Adjacent sequences: A131398 A131399 A131400 this_sequence A131402 A131403 A131404
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herbert A. Hauptman (hauptman(AT)hwi.buffalo.edu) & Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 07 2007
|
|
|
Search completed in 0.002 seconds
|
