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.

A180110 Numbers m such that A180076(m-2) < A180076(m-1) < A180076(m).

Original entry on oeis.org

2, 51, 70, 101, 122, 145, 318, 333, 344, 369, 402, 453, 456, 485, 496, 573, 578, 719, 782, 809, 852, 977, 1062, 1141, 1264, 1279, 1400, 1451, 1470, 1539, 1582, 1671, 1678, 1683, 1720, 1755, 1766, 1779, 1780, 1795, 1888, 1899, 1942, 1979, 2006, 2061, 2078
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 14 2010

Keywords

Comments

A180076(a(n)) = 9*A180076(a(n)-2)+4 = 3*(3*A180076(a(n)-2)+1)+1.

Examples

			a(1)=2: A180076(0..2) = (0,1,4);
a(2)=51: A180076(49..51) = (15,46,139);
a(39)=a(38)+1=1780: A180076(1777..1780) = (494,1483,4450,13331).
		

Programs

  • Haskell
    import Data.List (elemIndices)
    a180110 n = a180110_list !! (n-1)
    a180110_list = map (+ 2) $ elemIndices True $ zipWith (&&) zs (tail zs)
       where zs = zipWith (<) a180076_list (tail a180076_list)
    -- Reinhard Zumkeller, Feb 19 2013