|
Search: id:A102602
|
|
|
| A102602 |
|
a(n) = least k such that ((n+1)^k)*(n^k-1)-1 is prime with n odd > 2, or 0 if no such k exists. |
|
+0
1
|
|
| 1, 1, 1, 1, 4, 1, 1, 50, 1, 1, 2, 4, 1, 1, 3, 1, 1, 1, 2, 9, 1, 4, 1, 1, 9, 36, 158, 45, 1, 1, 10, 4, 1, 1, 3, 1, 1, 3, 5, 2, 6, 2, 1, 3, 1, 2, 2, 4, 2, 1, 15, 1, 4, 8, 2, 2, 1, 1, 1, 14, 5, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
For n=129 k > 2000 if k exists. When k=1 the prime is of the form n^2-2.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[ !PrimeQ[((n + 1)^k)*(n^k - 1) - 1], k++ ]; k]; Table[ f[n], {n, 3, 128, 2}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 06 2005)
|
|
CROSSREFS
|
Sequence in context: A113370 A078536 A158390 this_sequence A156951 A121066 A087565
Adjacent sequences: A102599 A102600 A102601 this_sequence A102603 A102604 A102605
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Pierre CAMI (pierrecami(AT)tele2.fr), Jan 29 2005
|
|
|
Search completed in 0.002 seconds
|
