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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214956 Number of primes of the form x^32 + 1 less than 10^n. 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,48

COMMENTS

It is conjectured that there are infinitely many primes of the form x^32 + 1 (and thus this sequence never becomes constant), but this has not been proved.

LINKS

Henryk Dabrowski, Table of n, a(n) for n = 1..128

EXAMPLE

a(55) = 2 because the only primes of the form x^32 + 1 < 10^55 are the primes: 2, 185302018885184100000000000000000000000000000001.

PROG

(PARI) a(n) = sum(k=1, (10^n-1)^(1/32), isprime(k^32+1))

CROSSREFS

Cf. A006315 (k such that k^32+1 is prime).

Cf. A083844, A214452, A214454, A214455.

Sequence in context: A261226 A003108 A279223 * A209899 A111898 A279041

Adjacent sequences:  A214953 A214954 A214955 * A214957 A214958 A214959

KEYWORD

nonn

AUTHOR

Henryk Dabrowski, Jul 30 2012

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 13 14:58 EST 2017. Contains 295958 sequences.