|
|
A078200
|
|
a(n) = A078199(n)/n; i.e., smallest k such that frequency of each occurring digit in k*n is the same.
|
|
1
|
|
|
11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 5, 4, 3, 2, 3, 2, 2, 2, 1, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 11, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
100,1
|
|
COMMENTS
|
a(211) = 13 is the first term that is not a palindrome (treating 10 as "010", a palindrome with leading zeros).
|
|
LINKS
|
|
|
EXAMPLE
|
a(112) = 560/112 = 5.
|
|
MATHEMATICA
|
balanced[n_] := Module[{u, d, r}, u=Union[d=Sort[IntegerDigits[n]]]; IntegerQ[r=Length[d]/Length[u]]&&d==Sort[Flatten[Table[u, {r}]]]]; a[n_] := For[k=1, True, k++, If[balanced[k*n], Return[k]]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|