

A137751


a(n) = number of missing residues in the Fibonacci sequence mod the nth prime number.


3



0, 0, 0, 0, 4, 4, 4, 7, 4, 19, 12, 8, 22, 10, 32, 16, 22, 36, 16, 27, 16, 30, 20, 72, 28, 66, 24, 74, 60, 80, 30, 49, 28, 106, 88, 114, 44, 40, 40, 36, 67, 119, 72, 44, 48, 183, 181, 54, 56, 149, 212, 90, 138, 94, 64, 178, 156, 102
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000
Casey Mongoven, Absent Residues Primes no. 1; electroacoustic music created with this sequence.


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 4 residues which do not occur in this sequence, namely {4,6,7,9}. So a(5) = 4.


CROSSREFS

Cf. A118965, A137750, A000045.
Sequence in context: A295641 A171815 A023958 * A244481 A211638 A211639
Adjacent sequences: A137748 A137749 A137750 * A137752 A137753 A137754


KEYWORD

nonn


AUTHOR

Casey Mongoven, Feb 10 2008


STATUS

approved



