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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104238 Positive integers n such that n^5 + 1 is semiprime. 13
2, 10, 12, 16, 22, 126, 136, 180, 256, 268, 276, 366, 388, 396, 438, 462, 606, 642, 652, 658, 676, 738, 760, 768, 982, 1012, 1068, 1116, 1230, 1276, 1320, 1452, 1488, 1530, 1618, 1692, 1698, 1752, 1846, 1948, 1996, 2080, 2112, 2160, 2332, 2392, 2440, 2520 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

n^5+1 can only be prime when n = 1, n^5+1 = 2. This is because of the polynomial factorization n^5+1 = (n+1) * (n^4 - n^3 + n^2 - n + 1). Hence after the initial n=1 prime, the binomial can at best be semiprime and that only when both (n+1) and (n^4 - n^3 + n^2 - n + 1) are primes.

FORMULA

a(n)^5 + 1 is semiprime. a(n)+1 is prime and a(n)^4 - a(n)^3 + a(n)^2 - a(n) + 1 is prime.

EXAMPLE

n n^5+1 = (n+1) * (n^4 - n^3 + n^2 - n + 1)

2 33 = 3 * 11

10 100001 = 11 * 9091

12 248833 = 13 * 19141

16 1048577 = 17 * 61681

MATHEMATICA

Select[Range[2600], PrimeOmega[#^5+1]==2&] (* From Harvey P. Dale, May 20 2011 *)

CROSSREFS

Cf. A000040, A001538, A103854.

Sequence in context: A053449 A060248 A092385 * A053069 A178504 A193733

Adjacent sequences:  A104235 A104236 A104237 * A104239 A104240 A104241

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost2(AT).com), Apr 02 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 14 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 07:46 EST 2012. Contains 205597 sequences.