A078199 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A078199

Smallest multiple of n (for n >= 100) in which frequency of each occurring digit is the same.

1100, 1010, 102, 103, 104, 105, 106, 107, 108, 109, 1100, 111, 560, 452, 342, 230, 348, 234, 236, 238, 120, 605, 610, 123, 124, 125, 126, 127, 128, 129, 130, 524, 132, 532, 134, 135, 136, 137, 138, 139, 140, 423, 142, 143, 432, 145, 146, 147, 148, 149, 150

(list; graph; refs; listen; history; text; internal format)

OFFSET

100,1

COMMENTS

Numbers from 1 to 99 are trivial and have been omitted.

LINKS

Robert Israel, Table of n, a(n) for n = 100..10000

EXAMPLE

a(112)=560 because 560 = 5*112 contains each of its digits once, while 112, 2*112=224, 3*112=336 and 4*112=448 do not have equal frequencies of their digits. - Robert Israel, Jun 08 2020

MAPLE

filter:= proc(n) local L;

L:= convert(n, base, 10);

nops({seq(numboccur(d, L), d=L)}) = 1

end proc:

f:= proc(n) local k;

for k from n by n do if filter(k) then return k fi od

end proc:

map(f, [$100..200]); # Robert Israel, Jun 08 2020

CROSSREFS

Cf. A078200.

Sequence in context: A278659 A280612 A281039 * A350709 A271472 A147816