|
| |
|
|
A007370
|
|
Numbers n such that sigma (x) = n has a unique solution.
(Formerly M2319)
|
|
14
| |
|
|
1, 3, 4, 6, 7, 8, 13, 14, 15, 20, 28, 30, 36, 38, 39, 40, 44, 57, 62, 63, 68, 74, 78, 91, 93, 102, 110, 112, 121, 127, 133, 138, 150, 158, 160, 162, 164, 171, 174, 176, 183, 194, 195, 198, 200, 204, 212, 217, 222, 230, 242
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
W. Sierpi\'{n}ski, Elementary Theory of Numbers. Pa\'{n}st. Wydaw. Nauk., Warsaw, 1964, p. 165.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
W. Sierpi\'{n}ski, Elementary Theory of Numbers, Warszawa 1964.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
|
|
|
MATHEMATICA
| a = Table[ 0, {250} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 251, a[ [ s ] ]++ ], {n, 1, 250} ]; Select[ Range[ 250 ], a[ [ # ] ] == 1 & ]
|
|
|
CROSSREFS
| Cf. A007369, A007371, A007372, etc.
Sequence in context: A002191 A108348 A085149 * A044813 A154661 A087753
Adjacent sequences: A007367 A007368 A007369 * A007371 A007372 A007373
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein, Robert G. Wilson v (rgwv(AT)rgwv.com)
|
| |
|
|
