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.

A216071 Brocard's problem: positive integers m such that m^2 = n! + 1 for some n.

Original entry on oeis.org

5, 11, 71
Offset: 1

Views

Author

V. Raman, Sep 01 2012

Keywords

Comments

See A085692 and A146968 for links, references and comments. - M. F. Hasler, Nov 20 2018

Crossrefs

A085692, A146968, A216071 are all essentially the same sequence. - N. J. A. Sloane, Sep 01 2012

Programs

Formula

a(n) = A000196(A085692(n)) = A000196(A038507(A146968(n))) where A000196 = sqrt and A038507(n) = n! + 1. - M. F. Hasler, Nov 20 2018