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.

A241157 Numbers in which the two least-significant digits are distinct.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110
Offset: 1

Views

Author

N. J. A. Sloane, Apr 18 2014

Keywords

Comments

More than the usual number of terms are displayed in order to show the difference from some closely-related sequences.

Crossrefs

Programs

  • Haskell
    a241157 n = a241157_list !! (n-1)
    a241157_list = 0 : filter f [0..] where
       f x = d' /= d where d' = mod x' 10; (x', d) = divMod x 10
    -- Reinhard Zumkeller, May 02 2014