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.

A071682 Least m such that A060207(m) = n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 7, 10, 13, 16, 20, 24, 28, 32, 37, 42, 47, 52, 57, 62, 68, 73, 79, 85, 91, 97, 103, 109, 116, 122, 129, 135, 142, 148, 155, 162, 169, 176, 183, 190, 197, 204, 211, 218
Offset: 2

Views

Author

David Wasserman, May 31 2002

Keywords

Crossrefs

Formula

a(n) = ceiling(log_2(A007097(n-2))).