|
%I #44 Sep 08 2022 08:45:15
%S 1,2,3,5,6,13,14,17,26,31,38,40,46,56,60,61,66,68,72,73,80,87,89,93,
%T 95,115,122,126,128,146,149,156,158,160,163,180,186,192,203,206,208,
%U 220,221,235,237,238,251,264,266,280,282,290,294,300,303,320,341,349,350
%N Positive integers k such that k^6 + k^5 + k^4 + k^3 + k^2 + k + 1 is prime.
%C The corresponding primes are A088550. - _Bernard Schott_, Dec 20 2012
%C k = 5978493 * 2^150006 - 1 is an example of a very large term of this sequence. The generated prime is proved by the N-1 method (because k is prime and k*(k+1) is fully factored and this provides for an exactly 33.33...% factorization for Phi_7(k) - 1). - _Serge Batalov_, Mar 13 2015
%H Vincenzo Librandi, <a href="/A100330/b100330.txt">Table of n, a(n) for n = 1..1000</a>
%e 2 is in the sequence because 2^6 + 2^5 + 2^4 + 2^3 + 2^2 + 2 + 1 = 127, which is prime.
%p A100330 := proc(n)
%p option remember;
%p local a;
%p if n = 1 then
%p 1;
%p else
%p for a from procname(n-1)+1 do
%p if isprime(numtheory[cyclotomic](7,a)) then
%p return a;
%p end if;
%p end do:
%p end if;
%p end proc:
%p seq(A100330(n),n=1..30) ; # _R. J. Mathar_, Feb 07 2014
%t Select[Range[350], PrimeQ[Sum[ #^i, {i, 0, 6}]] &] (* _Ray Chandler_, Nov 17 2004 *)
%t Do[If[PrimeQ[n^6 + n^5 + n^4 + n^3 + n^2 + n + 1], Print[n]], {n, 1, 500}] (* _Vincenzo Librandi_, Feb 08 2014 *)
%o (Magma) [n: n in [1..500]| IsPrime(n^6 + n^5 + n^4 + n^3 + n^2 + n + 1)]; // _Vincenzo Librandi_, Feb 08 2014
%o (PARI) is(n)=isprime(polcyclo(7,n)) \\ _Charles R Greathouse IV_, Apr 28 2015
%Y Cf. A100331, A250174 (Phi_14(n) = n^6 - n^5 + n^4 - n^3 + n^2 - n + 1 primes; these two sequences can also be considered an extension of each other into negative n values), A250177 (Phi_21(n) primes).
%K nonn
%O 1,2
%A _Ray G. Opao_, Nov 16 2004
|
