Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137751
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137751 a(n) = number of missing residues in the Fibonacci sequence mod the n-th prime number. +0
2
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; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research