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.

A002384 Numbers m such that m^2 + m + 1 is prime.

Original entry on oeis.org

1, 2, 3, 5, 6, 8, 12, 14, 15, 17, 20, 21, 24, 27, 33, 38, 41, 50, 54, 57, 59, 62, 66, 69, 71, 75, 77, 78, 80, 89, 90, 99, 101, 105, 110, 111, 117, 119, 131, 138, 141, 143, 147, 150, 153, 155, 161, 162, 164, 167, 168, 173, 176, 188, 189, 192, 194, 203, 206, 209, 215
Offset: 1

Views

Author

Keywords

Comments

A002383 lists the corresponding primes. - Bernard Schott, Dec 22 2012
This is also the list of bases where 111 represents a prime number. - Christian N. K. Anderson, Mar 28 2013
If d>1 divides m^2 + m + 1, then m + k*d is not in the sequence, for all k>=1. - Gionata Neri, Mar 04 2017

References

  • A. J. C. Cunningham, Binomial Factorisations, Vols. 1-9, Hodgson, London, 1923-1929; see Vol. 1, pp. 245-259.
  • D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 46.
  • L. Poletti, Le serie dei numeri primi appartenente alle due forme quadratiche (A) n^2+n+1 e (B) n^2+n-1 per l'intervallo compreso entro 121 milioni, e cioè per tutti i valori di n fino a 11000, Atti della Reale Accademia Nazionale dei Lincei, Memorie della Classe di Scienze Fisiche, Matematiche e Naturali, s. 6, v. 3 (1929), pages 193-218.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

a(n) = (A088503(n) - 1)/2. - Ray Chandler

Extensions

Extended by Ray Chandler, Sep 07 2005