|
| |
|
|
A106535
|
|
Numbers n such that the smallest x>1 for which Fibonacci(x) = 0 mod n is x=n-1.
|
|
3
| |
|
|
11, 19, 31, 59, 71, 79, 131, 179, 191, 239, 251, 271, 311, 359, 379, 419, 431, 439, 479, 491, 499, 571, 599, 631, 659, 719, 739, 751, 839, 971, 1019, 1039, 1051, 1091, 1171, 1259, 1319, 1399, 1439, 1451, 1459, 1499, 1531, 1559, 1571, 1619, 1759, 1811, 1831
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| Alfred Brousseau, Primes which are factors of all Fibonacci sequences, Fib. Quart., 2 (1964), 33-38.
Alfred Brousseau, "Fibonacci and Related Number Theoretic Tables".
|
|
|
PROG
| (GAP) Filtered([2..2000], n -> Fibonacci(n-1) mod n = 0 and Filtered( [2..n-2], x -> Fibonacci(x) mod n = 0 ) = [] );
|
|
|
CROSSREFS
| Cf. A000057, A001175.
Sequence in context: A155555 A152091 A122869 * A178150 A205798 A052368
Adjacent sequences: A106532 A106533 A106534 * A106536 A106537 A106538
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Peter K. Pearson (ppearson+att(AT)spamcop.net), May 06 2005
|
|
|
EXTENSIONS
| Corrected by T. D. Noe (noe(AT)sspectra.com), Oct 25 2006
|
| |
|
|
