login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105237 Positive integers n such that n^13 + 1 is semiprime. 13
2, 22, 108, 126, 180, 256, 336, 490, 630, 652, 660, 682, 708, 760, 828, 862, 882, 1030, 1038, 1128, 1162, 1216, 1318, 1450, 1612, 1930, 1950, 2010, 2236, 2268, 2380, 2436, 2658, 2752, 2800, 2962, 2998, 3036, 3048, 3318, 3672, 3922, 4152, 4396, 4506, 4816 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
We have the polynomial factorization: n^13+1 = (n+1) * (n^12 - n^11 + n^10 - n^9 + n^8 - n^7 + n^6 - n^5 + n^4 - n^3 + n^2 - n + 1) Hence after the initial n=1 prime, the binomial can never be prime. It can be semiprime iff n+1 is prime and n^12 - n^11 + n^10 - n^9 + n^8 - n^7 + n^6 - n^5 + n^4 - n^3 + n^2 - n + 1 is prime.
LINKS
EXAMPLE
2^13+1 = 8193 = 3 * 2731,
22^13+1 = 282810057883082753 = 23 * 12296089473177511,
1030^13+1 = 1468533713451564313811276230000000000001 = 1031 * 1424377995588326201562828545101842871.
MATHEMATICA
Select[Range[0, 300000], PrimeQ[# + 1] && PrimeQ[(#^13 + 1)/(# + 1)] &] (* Robert Price, Mar 11 2015 *)
PROG
(Magma) IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [n: n in [1..1600]|IsSemiprime(n^13+1)] // Vincenzo Librandi, Dec 21 2010
CROSSREFS
Sequence in context: A281647 A344498 A281140 * A325948 A216801 A083833
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Apr 12 2005
EXTENSIONS
a(19)-a(24) from Vincenzo Librandi, Dec 21 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)