|
Search: id:A007627
|
|
|
| A007627 |
|
Primitive modest numbers.
(Formerly M4888)
|
|
+0
2
|
|
| 13, 19, 23, 29, 49, 59, 79, 89, 103, 109, 111, 133, 199, 203, 209, 211, 233, 299, 311, 409, 411, 433, 499, 509, 511, 533, 599, 611, 709, 711, 733, 799, 809, 811, 833, 899, 911, 1003, 1009, 1011, 1027, 1033, 1037, 1099, 1111, 1133, 1199, 1233
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Modest numbers (A054986) are the same but without assuming (a,b)=1.
|
|
REFERENCES
|
Problem 1291, J. Rec. Math., 17 (No.2, 1984), 140-141.
|
|
FORMULA
|
n = a*10^k + b such that (a, b)=1, n == a (mod b), a<b<10^k.
|
|
CROSSREFS
|
Cf. A054986, A055018.
Sequence in context: A071621 A038888 A113017 this_sequence A121877 A109902 A058898
Adjacent sequences: A007624 A007625 A007626 this_sequence A007628 A007629 A007630
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Robert G. Wilson v (rgwv(AT)rgwv.com), Mira Bernstein (mira(AT)math.berkeley.edu)
|
|
|
Search completed in 0.002 seconds
|
