Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087580 Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1). +0
1
2, 3, 5, 11, 31, 47, 73, 157, 191, 521, 877, 1021, 1487, 6011, 7841, 11789, 14983, 33071, 83243, 123833, 156671, 262937, 778763, 825131, 975181, 5102543, 7066723, 12787321, 13815779, 21304139, 72462361, 76818979, 87392713, 110204261 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Sequence in context: A047934 A090235 A103596 this_sequence A072535 A073680 A079557

Adjacent sequences: A087577 A087578 A087579 this_sequence A087581 A087582 A087583

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 17 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 13 2005

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research