|
|
A137750
|
|
Number of distinct residues in the Fibonacci sequence mod the n-th prime.
|
|
3
|
|
|
2, 3, 5, 7, 7, 9, 13, 12, 19, 10, 19, 29, 19, 33, 15, 37, 37, 25, 51, 44, 57, 49, 63, 17, 69, 35, 79, 33, 49, 33, 97, 82, 109, 33, 61, 37, 113, 123, 127, 137, 112, 62, 119, 149, 149, 16, 30, 169, 171, 80, 21, 149, 103, 157, 193, 85
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The 5th prime number is 11. The Fibonacci sequence mod 11 is {0,1,1,2,3,5,8,2,10,1,0,1,...} - a periodic sequence. There are 7 distinct residues in this sequence, namely {0,1,2,3,5,8,10}. So a(5) = 7.
|
|
MATHEMATICA
|
With[{f=Fibonacci[Range[500]]}, Table[Length[Union[Mod[f, Prime[n]]]], {n, 60}]] (* Harvey P. Dale, Aug 15 2012 *)
|
|
PROG
|
(PARI) a(n)=my(v=List([0, 1]), p=prime(n)); while(v[#v]||v[#v-1]!=1, listput(v, (v[#v]+v[#v-1])%p)); #vecsort(Vec(v), , 8) \\ Charles R Greathouse IV, Apr 24 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|