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.

A309202 Peter Munn showed in A111273 that if A111273(n)=m then if m is odd, n <= m, and if m is even, n <= 2*m-1; a(n) is either m-n or 2*m-1-n in the two cases.

Original entry on oeis.org

0, 1, 0, 1, 10, 1, 0, 3, 0, 1, 32, 1, 78, 7, 0, 1, 34, 1, 0, 7, 12, 1, 0, 15, 0, 1, 8, 1, 58, 1, 0, 15, 154, 1, 24, 1, 666, 1, 12, 1, 82, 1, 128, 1, 24, 1, 140, 7, 0, 25, 16, 1, 106, 1, 32, 19, 0, 1, 176, 1, 1830, 1, 0, 15, 0, 1, 200, 23, 36, 1, 0, 1, 2628, 37, 24, 1, 66, 1, 236, 27, 0, 1, 0, 55, 0, 43
Offset: 1

Views

Author

N. J. A. Sloane, Jul 26 2019

Keywords

Comments

It is known that if p is an odd prime, a(p-1) = 1 (see A111273).

Crossrefs

Cf. A111273.