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.

A226091 Smallest m such that A225985(m) = A014261(n).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 22, 24, 26, 28, 30, 37, 39, 41, 43, 45, 52, 54, 56, 58, 60, 67, 69, 71, 73, 75, 87, 89, 91, 93, 95, 107, 109, 111, 113, 115, 127, 129, 131, 133, 135, 147, 149, 151, 153, 155, 167, 169, 171, 173, 175, 262, 264, 266, 268, 270
Offset: 1

Views

Author

Reinhard Zumkeller, May 26 2013

Keywords

Comments

A225985(a(n)) = A014261(n).

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a226091 = (+ 1) . fromJust . (`elemIndex` a225985_list) . a014261