|
%I #4 Sep 22 2015 15:05:40
%S 1,10,11,12,2,20,22,21,100,101,102,110,111,112,120,121,122,200,202,
%T 201,212,210,221,211,222,220,1002,1001,1000,1010,1011,1012,1021,1020,
%U 1101,1022,1102,1110,1100,1111,1112,1120,1121,1122,1201,1200,1211,1202,1212
%N A262411 in ternary representation.
%C a(n) = A007089(A262411(n)).
%H Reinhard Zumkeller, <a href="/A262412/b262412.txt">Table of n, a(n) for n = 1..10000</a>
%e See A262411.
%o (Haskell)
%o import Data.List (inits, tails, intersect, delete)
%o a262412 n = a262412_list !! (n - 1)
%o a262412_list = 1 : f [1] (drop 2 a030341_tabf) where
%o f xs tss = g tss where
%o g (ys:yss) | null (intersect its $ tail $ inits ys) &&
%o null (intersect tis $ init $ tails ys) = g yss
%o | otherwise = (foldr (\t v -> 10 * v + t) 0 ys) :
%o f ys (delete ys tss)
%o its = init $ tails xs; tis = tail $ inits xs
%o -- _Reinhard Zumkeller_, Sep 22 2015
%Y Cf. A030341, A007089, A262411.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Sep 22 2015
|
