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.

A125218 Numbers having at least two representations as 4*x*y-x-y with 1<=x<=y.

Original entry on oeis.org

26, 41, 47, 56, 68, 71, 74, 86, 89, 96, 101, 107, 110, 116, 128, 131, 140, 146, 152, 155, 161, 166, 173, 176, 182, 185, 191, 194, 201, 206, 209, 215, 221, 224, 236, 239, 242, 250
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 24 2006

Keywords

Comments

A125203(a(n)) > 1.
A124934 is the union of this sequence and A125217.

Programs

  • Haskell
    import Data.List (findIndices)
    a125218 n = a125218_list !! (n-1)
    a125218_list = map (+ 1) $ findIndices (> 1) a125203_list
    -- Reinhard Zumkeller, Jan 02 2013