|
%I #10 Feb 15 2017 19:36:35
%S 0,6,24,42,48,60,66,84,204,222,228,240,246,264,282,288,402,408,420,
%T 426,444,462,468,480,486,600,606,624,642,648,660,666,684,804,822,828,
%U 840,846,864,882,888,2004,2022,2028,2040,2046,2064,2082,2088,2202,2208
%N Multiples of 3 with all even digits.
%C The numbers b(d) of terms from 10^(d-1) to 10^d satisfy the recurrence b(d) = 6 b(d-1) - 6 b(d-2) + 5 b(d-3) with b(1)=1, b(2)=6, b(3)=33. For d >= 4, b(d) = (3*A276508(d) - 10*A276508(d-1) + 3*A276508(d-2))/7. - _Robert Israel_, Feb 15 2017
%H Robert Israel, <a href="/A061811/b061811.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%e 228 has all even digits and 228 = 3*76.
%p N:= 4: # for all terms < 10^N
%p E[1,0]:= {6}:
%p E[1,1]:= {4}:
%p E[1,2]:= {2,8}:
%p for n from 2 to N do
%p for j from 0 to 2 do
%p E[n,j]:= map(t -> (10*t, 10*t+6),E[n-1,j]) union
%p map(t -> (10*t+2, 10*t+8), E[n-1,j+1 mod 3]) union
%p map(t -> 10*t+4, E[n-1,j+2 mod 3]);
%p od od:
%p A:=sort([0,seq(op(E[i,0]),i=1..N)]); # _Robert Israel_, Feb 15 2017
%o (PARI) is(n)=n%3==0 && #setintersect(Set(digits(n)), [1,3,5,7,9])==0 \\ _Charles R Greathouse IV_, Feb 15 2017
%Y Cf. A061810, A276508.
%K nonn,base,easy
%O 1,2
%A _Amarnath Murthy_, May 28 2001
%E More terms from Larry Reeves (larryr(AT)acm.org), May 30 2001
%E Offset corrected by _Charles R Greathouse IV_, Feb 15 2017
|
