|
Search: id:A046952
|
|
|
| A046952 |
|
Sets record for f(n) = |{(a,b):a*b=n and a|b}|. Also squares of highly composite numbers A002182. |
|
+0
3
|
|
| 1, 4, 16, 36, 144, 576, 1296, 2304, 3600, 14400, 32400, 57600, 129600, 518400, 705600, 1587600, 2822400, 6350400, 25401600, 57153600, 101606400, 228614400, 406425600, 635040000, 768398400, 2057529600, 2540160000, 3073593600
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Invented by the HR automatic theory 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
|
|
EXAMPLE
|
f(1)=1, (first with 1), f(4)=2 (first with 2), f(16)=3 (first with 3),
|
|
CROSSREFS
|
Cf. A002182, A046951.
Sequence in context: A075408 A114268 A136404 this_sequence A081456 A130279 A030158
Adjacent sequences: A046949 A046950 A046951 this_sequence A046953 A046954 A046955
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Simon Colton (simonco(AT)cs.york.ac.uk)
|
|
|
Search completed in 0.002 seconds
|
