|
%I #12 Mar 13 2014 16:35:29
%S 2,51,70,101,122,145,318,333,344,369,402,453,456,485,496,573,578,719,
%T 782,809,852,977,1062,1141,1264,1279,1400,1451,1470,1539,1582,1671,
%U 1678,1683,1720,1755,1766,1779,1780,1795,1888,1899,1942,1979,2006,2061,2078
%N Numbers m such that A180076(m-2) < A180076(m-1) < A180076(m).
%C A180076(a(n)) = 9*A180076(a(n)-2)+4 = 3*(3*A180076(a(n)-2)+1)+1.
%H Reinhard Zumkeller, <a href="/A180110/b180110.txt">Table of n, a(n) for n = 1..750</a>
%e a(1)=2: A180076(0..2) = (0,1,4);
%e a(2)=51: A180076(49..51) = (15,46,139);
%e a(39)=a(38)+1=1780: A180076(1777..1780) = (494,1483,4450,13331).
%o (Haskell)
%o import Data.List (elemIndices)
%o a180110 n = a180110_list !! (n-1)
%o a180110_list = map (+ 2) $ elemIndices True $ zipWith (&&) zs (tail zs)
%o where zs = zipWith (<) a180076_list (tail a180076_list)
%o -- _Reinhard Zumkeller_, Feb 19 2013
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Aug 14 2010
|
