|
Search: id:A054986
|
|
|
| A054986 |
|
Base-10 modest numbers. |
|
+0
3
|
|
| 13, 19, 23, 26, 29, 39, 46, 49, 59, 69, 79, 89, 103, 109, 111, 133, 199, 203, 206, 209, 211, 218, 222, 233, 266, 299, 309, 311, 327, 333, 399, 406, 409, 411, 412, 418, 422, 433, 436, 444, 466, 499, 509, 511, 515, 533, 545, 555, 599, 609, 611, 618, 622, 627
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A number is modest if there exists at least one partitioning of its decimal expansion wherein the number divided by the second part leaves a remainder of the first part.
|
|
REFERENCES
|
Problem 1291, J. Rec. Math., 17 (No.2, 1984), 140-141.
|
|
EXAMPLE
|
2036 is modest because Mod[2036, 36] = 20. 2037 is modest because Mod[2037, 037] = 2.
|
|
CROSSREFS
|
Cf. A007627.
Sequence in context: A118845 A050717 A088184 this_sequence A071621 A160951 A038888
Adjacent sequences: A054983 A054984 A054985 this_sequence A054987 A054988 A054989
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Hans Havermann (pxp(AT)rogers.com), May 30 2000
|
|
|
Search completed in 0.002 seconds
|
