|
Search: id:A078200
|
|
|
| A078200 |
|
a(n) = A078199(n)/n; i.e. smallest k such that frequency of each occurring digit in k*n is the same. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
100,1
|
|
|
COMMENT
|
a(211) = 13 is the first term that is not a palindrome (treating 10 as "010", a palindrome with leading zeros).
|
|
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
|
Cf. A078199.
Sequence in context: A165943 A038323 A121154 this_sequence A105034 A065001 A022967
Adjacent sequences: A078197 A078198 A078199 this_sequence A078201 A078202 A078203
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 21 2002
|
|
EXTENSIONS
|
Corrected and extended by Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 09 2003
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 17 2003
|
|
|
Search completed in 0.002 seconds
|
