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.

A227954 Smallest m such that A070965(m) = -n.

Original entry on oeis.org

3, 15, 78, 115, 155, 310, 231, 911, 619, 691, 464, 863, 1294, 1616, 3240, 2235, 1240, 2240, 3472, 3183, 4479, 2766, 4148, 9212, 6588, 4567, 2587, 2588, 4846, 6479, 3231, 7763, 3744, 3743, 2479, 2480, 6367, 7440, 12936, 2768, 9914, 9395, 13415, 11059, 9792
Offset: 0

Views

Author

Reinhard Zumkeller, Aug 01 2013

Keywords

Crossrefs

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a227954 = (+ 1) . fromJust . (`elemIndex` a070965_list) . negate

Formula

A070965(a(n)) = -n and A070965(m) <> -n for m < a(n);
A070965(A227953(n)) = n.