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.

A218620 Least number m to appear exactly n times in A095972.

Original entry on oeis.org

7, 1, 0, 2, 18, 128, 443, 2666, 1353, 2706
Offset: 0

Views

Author

M. F. Hasler, Nov 03 2012

Keywords

Comments

One has n/2 <= A095972(n)+1 <= n, therefore an integer m can appear in A095972 only between indices m and 2m, and this sequence is effectively computable.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.