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.

A055018 Numbers n such that n and n+1 are modest (cf. A054986).

Original entry on oeis.org

411, 811, 1421, 2036, 2044, 2054, 3054, 4036, 4044, 4054, 8036, 12036, 16036, 20036, 24036, 28036, 32036, 40011, 40044, 50054, 50074, 80011, 88296, 100110, 100270, 100369, 120296, 120404, 140021, 144242, 176296, 200044, 200270, 200369
Offset: 1

Views

Author

Hans Havermann, May 31 2000

Keywords

Examples

			2036 is modest because Mod[2036, 36] = 20. 2037 is modest because Mod[2037, 037] = 2. Hence 2036 is this pair's modest twin representative.
		

Programs

  • Haskell
    import Data.List (elemIndices)
    a055018 n = a055018_list !! (n-1)
    a055018_list = map (a054986 . (+ 1)) $ elemIndices 1 $
                   zipWith (-) (tail a054986_list) a054986_list
    -- Reinhard Zumkeller, Mar 26 2012