login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
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 (list; graph; refs; listen; history; text; internal format)
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: A199916 A180494 A200653 * A316568 A198927 A198100

Adjacent sequences:  A058061 A058062 A058063 * A058065 A058066 A058067

KEYWORD

hard,nonn

AUTHOR

Robert G. Wilson v, Nov 14 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 10:52 EDT 2019. Contains 327129 sequences. (Running on oeis4.)