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

 


a(n) = 840*n^2-23100*n+86861.
1

%I #16 Sep 08 2022 08:46:03

%S 86861,64601,44021,25121,7901,-7639,-21499,-33679,-44179,-52999,

%T -60139,-65599,-69379,-71479,-71899,-70639,-67699,-63079,-56779,

%U -48799,-39139,-27799,-14779,-79,16301,34361,54101,75521,98621,123401,149861,178001,207821,239321,272501

%N a(n) = 840*n^2-23100*n+86861.

%C |a(n)| are distinct primes for n = 0 to 32.

%C The values of this polynomial are never divisible by a prime less than 79.

%C All terms are congruent to 1 (mod 20).

%H Arkadiusz Wesolowski, <a href="/A216257/b216257.txt">Table of n, a(n) for n = 0..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).

%F G.f.: (86861-195982*x+110801*x^2)/(1-x)^3.

%p seq(840*n^2-23100*n+86861, n=0..34);

%t Table[840*n^2 - 23100*n + 86861, {n, 0, 34}]

%o (Magma) [ 840*n^2-23100*n+86861 : n in [0..34]]

%o (PARI) for(n=0, 34, print1(840*n^2-23100*n+86861, ", "))

%Y Cf. A215145, A141881, A141887.

%K easy,sign

%O 0,1

%A _Arkadiusz Wesolowski_, Mar 15 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 02:59 EDT 2024. Contains 376140 sequences. (Running on oeis4.)