Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102601 a(n)= least k such that ((k+1)^n)*(k^n-1)-1 is prime. +0
1
2, 3, 3, 3, 5, 3, 29, 109, 9, 3, 35, 19, 5, 123, 31, 37, 189, 47, 97, 23, 113, 11, 509, 3, 33, 25, 55, 21, 85, 123, 35, 7, 211, 357, 239, 3, 1507, 33, 29, 3, 11, 53, 7, 15, 59, 797, 533, 167, 229, 17, 39, 137, 43, 733, 35, 273, 7, 235, 399, 63, 149, 189, 403, 151, 1021, 303 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

f[n_] := Block[{k = 1}, While[ !PrimeQ[((k + 1)^n)*(k^n - 1) - 1], k += 2]; k]; Table[ f[n], {n, 66}] (from Robert G. Wilson v Feb 10 2005)

CROSSREFS

Sequence in context: A066660 A057957 A076559 this_sequence A092308 A081831 A111912

Adjacent sequences: A102598 A102599 A102600 this_sequence A102602 A102603 A102604

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Jan 29 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 10 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research