A045811 In the list of divisors of n (in base 3), each digit 0-2 appears equally often.
20, 10022, 10202, 12002, 12020, 12200, 20012, 20102, 20120, 20201, 20210, 20220, 21002, 21200, 22002, 22010, 22020, 22100, 22200, 1210020, 1210022, 1212200, 1220100, 10222011, 12200220, 12202020, 12210210, 20010121, 20010212
Offset: 1
Examples
Divisors of 12200 are (1, 10, 100, 122, 1220, 12200); the numbers of digits (0-2) are [0(6), 1(6), 2(6)].
Links
- Robert Israel, Table of n, a(n) for n = 1..2500
- Naohiro Nomoto, In the list of divisors of n,... [Broken link]
Programs
-
Maple
f:= proc(n) local D,v,r,i; D:= map(op@convert,convert(numtheory:-divisors(n),list),base,3); if nops({numboccur(0,D),numboccur(1,D),numboccur(2,D)})=1 then r:= convert(n,base,3); add(r[i]*10^(i-1),i=1..nops(r)) fi end proc: map(f, [$1..3^8]); # Robert Israel, Nov 14 2020