|
%I #23 Jan 13 2019 19:32:29
%S 0,2,3,5,9,11,12,14,27,29,30,32,36,38,39,41,81,83,84,86,90,92,93,95,
%T 108,110,111,113,117,119,120,122,243,245,246,248,252,254,255,257,270,
%U 272,273,275,279,281,282,284,324,326,327,329,333,335,336,338,351,353,354,356,360,362,363,365,729,731,732,734,738,740
%N Stanley Sequence S(0,2).
%C See A185256.
%C In ternary these numbers have 0's and 1's everywhere, except the last digit is either 0 or 2. [_Tanya Khovanova_, Nov 16 2013]
%C a(n) = A005836(n) + A000035(n). [_Tanya Khovanova_, Nov 16 2013]
%H Alois P. Heinz, <a href="/A186776/b186776.txt">Table of n, a(n) for n = 1..2000</a>
%F Equals A004793(n)-1, also A033160(n)-2, also A033163(n)-3. Note that A004793 has a recurrence.
%t Select[Range[0, 1000], MatchQ[IntegerDigits[#, 3], {(0|1)..., 0|2}]&] (* _Jean-François Alcover_, Jan 13 2019, after _Tanya Khovanova_ *)
%Y Cf. A185256, A004793, A033160, A033163.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Mar 19 2011
|
