|
%I #12 Jul 13 2013 12:01:55
%S 1,10,12,13,14,16,18,20,22,24,26,28,33,53,73,93,113,133,153,173,190,
%T 193,195,196,199,202,205,208,211,214,217,220,221,223,224,225,226,227,
%U 229,230,232,233,235,236,238,239,241,242,244,245
%N Position of n-th 1 in A007376.
%C A007376(a(n)) = 1;
%C a(n) = Min{A031287(n), A031288(n), A031289(n), A031290(n), A031291(n), A031292(n), A031293(n), A031294(n), A031295(n), A031296(n)}. [_Reinhard Zumkeller_, Jul 28 2011]
%H Reinhard Zumkeller, <a href="/A031288/b031288.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndices)
%o a031288 n = a031288_list !! (n-1)
%o a031288_list = map (+ 1) $ elemIndices 1 a007376_list
%o -- _Reinhard Zumkeller_, Jul 28 2011
%Y Cf. A193428.
%K nonn,less,base
%O 1,2
%A _Clark Kimberling_
|
