login
A058064
Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.
3
0, 0, 0, 1, 0, 0, 1, 0, 0, 5, 0, 1, 2, 0, 0, 2, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2
OFFSET
1,10
MATHEMATICA
Do[ k = 0; While[ !PrimeQ[ (n + 1)^(2^k) + n^(2^k) ], k++ ]; Print[ 2^k ], {n, 1, 60} ].
CROSSREFS
Cf. A057856.
Sequence in context: A180494 A200653 A371940 * A316568 A198927 A198100
KEYWORD
hard,nonn
AUTHOR
Robert G. Wilson v, Nov 14 2000
STATUS
approved