The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268752 Cubefree numbers n such that n^2 + 1 is prime. 2
 1, 2, 4, 6, 10, 14, 20, 26, 36, 66, 74, 84, 90, 94, 110, 116, 124, 126, 130, 134, 146, 150, 156, 170, 180, 204, 206, 210, 230, 236, 260, 284, 300, 306, 314, 326, 340, 350, 386, 396, 406, 420, 430, 436, 444, 466, 470, 474, 490, 556, 570, 634, 636, 644, 646, 654 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Subsequence of A004709. Intersection of A004709 and A005574. - Robert Israel, Feb 12 2016 LINKS K. D. Bajpai, Table of n, a(n) for n = 1..10000 EXAMPLE a(5) = 10 = 2 * 5 that is cubefree. 10^2 + 1 = 101 which is a prime. a(6) = 14 = 2 * 7 that is cubefree. 14^2 + 1 = 197 which is a prime. MAPLE select(t -> isprime(t^2+1) and max(map(f->f[2], ifactors(t)[2]))<=2, [\$1..1000]); # Robert Israel, Feb 12 2016 MATHEMATICA Select[Range[1000], FreeQ[FactorInteger[#], {_, k_ /; k > 2}] && PrimeQ[#^2 + 1] &] PROG (PARI) for(n=1, 1000, f = factor(n)[, 2]; if ((#f == 0) || vecmax(f) < 3, if (isprime(n^2+1), print1(n, ", ")))); CROSSREFS Cf. A000040, A002496, A004709, A005574, A268697. Sequence in context: A088932 A088954 A000123 * A277277 A241337 A103257 Adjacent sequences:  A268749 A268750 A268751 * A268753 A268754 A268755 KEYWORD nonn AUTHOR K. D. Bajpai, Feb 12 2016 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.

Last modified November 28 07:44 EST 2020. Contains 338702 sequences. (Running on oeis4.)