|
Search: id:A036432
|
|
|
| A036432 |
|
Sets a record for the number of positive integers which, when added to the number of their divisors, gives n. |
|
+0
2
|
|
| 1, 2, 7, 38, 122, 2766, 64686, 1972296, 5387768, 56208248, 753815160, 130065181784
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Invented by the HR concept formation program.
|
|
LINKS
|
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2.
S. Colton, HR - Automatic Theory Formation in Pure Mathematics
|
|
FORMULA
|
Sets record for |{b in N : b + tau(b) = n}|
|
|
EXAMPLE
|
2=1+tau(1) [ first with 1 ] 7=4+tau(4) and 5+tau(5) [ first with 2 ] 38=30+tau(30) and 32+tau(32) and 34+tau(34) [ first with 3 ]
|
|
CROSSREFS
|
Cf. A036431.
Sequence in context: A001028 A116481 A102743 this_sequence A094431 A032109 A088792
Adjacent sequences: A036429 A036430 A036431 this_sequence A036433 A036434 A036435
|
|
KEYWORD
|
hard,nonn,nice,more
|
|
AUTHOR
|
Simon Colton (simonco(AT)cs.york.ac.uk)
|
|
EXTENSIONS
|
More terms from Julian Richardson (julianr(AT)dai.ed.ac.uk), who has searched up to 100000000.
a(10)-a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Feb 19 2009
|
|
|
Search completed in 0.002 seconds
|
