|
%I #25 Feb 20 2021 17:24:20
%S 2,20,110,200,1010,1100,2000,10010,10100,11000,20000,100010,100100,
%T 101000,110000,200000,1000010,1000100,1001000,1010000,1100000,2000000,
%U 10000010,10000100,10001000,10010000,10100000,11000000,20000000,100000010,100000100,100001000
%N Multiples of 2 whose digit sum is 2.
%H Alois P. Heinz, <a href="/A069537/b069537.txt">Table of n, a(n) for n = 1..10000</a>
%o (Python)
%o from itertools import product
%o def agen():
%o digits = 1
%o while True:
%o for i in range(digits-2): yield int("1"+"0"*(digits-3-i)+"1"+"0"*i+"0")
%o yield int("2"+"0"*(digits-1))
%o digits += 1
%o g = agen()
%o print([next(g) for i in range(32)]) # _Michael S. Branicky_, Feb 20 2021
%Y Cf. A069521 to A069530, A069532, A069534, A069536.
%Y Subsequence of A005349.
%Y Row n=2 of A245062.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Apr 01 2002
%E Corrected and extended by _Ray Chandler_, Sep 28 2003
|
