Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087358
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087358 Smallest prime such that a(n+1)-a(n) == 0 (mod n^n). +0
1
2, 3, 7, 61, 317, 31567, 218191, 34806997, 101915861, 3201279773, 143201279773, 13838161469101, 85166965055149, 3113918030977679, 36449938507651727, 6166964403839682977, 264421381435773405601, 36662992904434591029389 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(4)-a(3) = 61-7 = 54 == 0 (mod 3^3).

CROSSREFS

Sequence in context: A030090 A075461 A059785 this_sequence A057736 A130309 A090870

Adjacent sequences: A087355 A087356 A087357 this_sequence A087359 A087360 A087361

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), May 12 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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research