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.

Showing 1-1 of 1 results.

A064689 Smallest m such that A064672(m) = n.

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 12, 15, 32, 43, 48, 61, 136, 159, 240, 527, 572, 1009, 1022, 1085, 1910, 2365, 3782, 6377, 13384, 17929, 18736, 25521, 57840, 155021, 258058, 266247, 267278, 278751, 315806, 328269
Offset: 0

Views

Author

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 09 2001

Keywords

Comments

A064672(a(n)) = n and A064672(m) < n for m < a(n).

Crossrefs

Cf. A064672.

Programs

  • Haskell
    import Data.List (elemIndex)
import Data.Maybe (fromJust)
a064689 = fromJust . (`elemIndex` a064672_list)
-- Reinhard Zumkeller, Apr 27 2012

Extensions

More terms from Vladeta Jovovic, Oct 13 2001
Initial term added and offset adjusted by Reinhard Zumkeller, Apr 27 2012
Showing 1-1 of 1 results.

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

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