|
Search: id:A064414
|
|
|
| A064414 |
|
Fix a > 0, b > 0, k > 0 and define G_1 = a, G_2 = b, G_k = G_(k-1) + G_(k-2); sequence gives n such that for any (a,b), some G_k is divisible by n. |
|
+0
2
|
|
| 1, 2, 3, 4, 6, 7, 9, 14, 23, 27, 43, 49, 67, 81, 83, 86, 98, 103, 127, 134, 163, 167, 206, 223, 227, 243, 254, 283, 326, 343, 367, 383, 443, 446, 463, 467, 487, 503, 523, 529, 547, 566, 587, 607, 643, 647, 683, 686, 727, 729, 734, 787, 823, 827, 863, 883, 887
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Teruo Nishiyama, Fibonacci numbers, Suuri-Kagaku, No. 285, March 1987, 67-69, (in Japanese).
|
|
EXAMPLE
|
If a = 1, b = 4, then G_k is (1,4,5,9,14,23,....) and no G_k is a multiple of 11. Therefore 11 is not in the sequence.
|
|
CROSSREFS
|
Prime members are in A000057.
Sequence in context: A089388 A055494 A165773 this_sequence A002475 A057519 A155905
Adjacent sequences: A064411 A064412 A064413 this_sequence A064415 A064416 A064417
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), Oct 15 2001
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 18 2002
|
|
|
Search completed in 0.002 seconds
|
