Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076519
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076519 Numbers n such that Fibonacci(n) == prime(n) (mod n). +0
1
1, 2, 3, 4, 68, 76, 116, 181, 357, 789, 1251, 3861 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Select[Range[3*10^4], Mod[Fibonacci[ # ], # ] == Mod[Prime[ # ], # ] &]

CROSSREFS

Sequence in context: A004855 A097930 A012322 this_sequence A066776 A115901 A073325

Adjacent sequences: A076516 A076517 A076518 this_sequence A076520 A076521 A076522

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 17 2002

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research