login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Casey Mongoven, Unique Residues Primes no. 1; electro-acoustic music created with this sequence.
FORMULA
a(n) = A066853(A000040(n)). - Max Alekseyev, Feb 08 2023
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
Casey Mongoven, Feb 10 2008
STATUS
approved