OFFSET
1,1
COMMENTS
Equivalently, sequences of 2's and 3's, ending with 3, where the number of 2's is congruent to 2 mod 3. - Franklin T. Adams-Watters, Dec 14 2008
LINKS
MAPLE
(Maple program from Robert Israel:)
M:= proc(n) option remember; (map(t -> 2*10^n+t, M(n-1)) union map(t ->
3*10^n+t, M(n-1))) end proc;
M(0):= {2, 3};
select(t -> (t mod 6 = 1), `union`(seq(M(n), n=1..9)));
MATHEMATICA
Do[If[Union[IntegerDigits[6k+1]]=={2, 3}, Print[6k+1]], {k, 100000}]
Select[Flatten[Table[FromDigits/@Tuples[{2, 3}, n], {n, 7}]], Mod[#, 6]==1&] (* Harvey P. Dale, Aug 02 2015 *)
PROG
(PARI) is(n)=n%30==13 && Set(digits(n))==[2, 3] \\ Charles R Greathouse IV, Feb 15 2017
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Zak Seidov, Dec 14 2008
EXTENSIONS
Extended by Robert Israel, Dec 14 2008
STATUS
approved