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.

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

Links

Table of n, a(n) for n=1..27.

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

Adjacent sequences: A058061 A058062 A058063 * A058065 A058066 A058067

Keyword

hard,nonn

Author

Robert G. Wilson v, Nov 14 2000

Status

approved