|
| |
|
|
A085790
|
|
Integers sorted by the sum of their divisors.
|
|
4
| |
|
|
1, 2, 3, 5, 4, 7, 6, 11, 9, 13, 8, 10, 17, 19, 14, 15, 23, 12, 29, 16, 25, 21, 31, 22, 37, 18, 27, 20, 26, 41, 43, 33, 35, 47, 34, 53, 28, 39, 49, 24, 38, 59, 61, 32, 67, 30, 46, 51, 55, 71, 73, 45, 57, 79, 44, 65, 83, 40, 58, 89, 36, 50, 42, 62, 69, 77, 52, 97, 101, 63, 103, 85
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Integers having the same sum of divisors are sorted in ascending order, e.g. sigma(14)=sigma(15)=sigma(23)=24 -> a(15)=14, a(16)=15, a(17)=23
|
|
|
LINKS
| H. Pfoertner, Table of n, a(n) for n=1,...,10000
|
|
|
EXAMPLE
| a(9)=9, a(10)=13, a(11)=8 because sigma(9)=13=9+3+1, sigma(13)=14=13+1,
sigma(8)=15=8+4+2+1 and there are no other numbers with those sigma values.
|
|
|
CROSSREFS
| Cf. A000203 (sigma(n)), A007609 (values taken by sigma(n), sorted), A002191 (possible values for sigma(n)).
Sequence in context: A064707 A123882 A102454 * A117120 A181095 A127515
Adjacent sequences: A085787 A085788 A085789 * A085791 A085792 A085793
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 23 2003
|
| |
|
|
