cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A214732 a(n) = 25*n^2 + 15*n + 1021.

Original entry on oeis.org

1021, 1061, 1151, 1291, 1481, 1721, 2011, 2351, 2741, 3181, 3671, 4211, 4801, 5441, 6131, 6871, 7661, 8501, 9391, 10331, 11321, 12361, 13451, 14591, 15781, 17021, 18311, 19651, 21041, 22481, 23971, 25511, 27101, 28741, 30431, 32171, 33961, 35801, 37691
Offset: 0

Views

Author

Robert Potter, Jul 27 2012

Keywords

Comments

This is the case m=5 and k=41 of the formula m^2*n^2 + (m^2 - 2*m)*n + (m^2*k) - (m-1). The most famous example is when m=1 and k=41 (Euler's generating polynomial). With k=41 the formula gives consecutive primes for m=10 and n=0..10, m=17 and n=0..10, m=86 and n=0..8. It is interesting to note that the sequences produced are all factors of the semiprimes produced by m=1, k=41. The other famous values to try for k are 5, 11 and 17 as these all produce primes up to k^2.

Crossrefs

Cf. A215814.

Programs

Formula

G.f.: (1021-2002*x+1031*x^2)/(1-x)^3. - Bruno Berselli, Aug 28 2012
E.g.f.: (1021 + 40*x + 25*x^2)*exp(x). - G. C. Greubel, Apr 26 2021