|
Search: id:A033950
|
|
|
| A033950 |
|
Refactorable numbers: number of divisors of n divides n. Also known as tau numbers. |
|
+0
68
|
|
| 1, 2, 8, 9, 12, 18, 24, 36, 40, 56, 60, 72, 80, 84, 88, 96, 104, 108, 128, 132, 136, 152, 156, 180, 184, 204, 225, 228, 232, 240, 248, 252, 276, 288, 296, 328, 344, 348, 360, 372, 376, 384, 396, 424, 441, 444, 448, 450, 468, 472, 480, 488, 492, 504, 516, 536
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
n such that the equation gcd(n,x)=tau(n) has solutions - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 10 2002
Refactorable numbers are the fixed points of A009230. - Labos E. (labos(AT)ana.sote.hu), Nov 18 2002
|
|
REFERENCES
|
Colton, S., Bundy, A., and Walsh, T. R. S., HR - A system for machine discovery in finite algebras, ECAI 98, forthcoming.
R. K. Guy, Unsolved Problems in Number Theory, B12.
Kennedy, Robert E. and Cooper, Curtis N.; Tau numbers, natural density, and Hardy and Wright's Theorem 437, Internat. J. Math. Math. Sci. 13 (1990), no. 2, 383-386.
New Scientist, 5th Sept. 1998, p. 17, para. 3.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2.
S. Colton, HR - Automatic Theory Formation in Pure Mathematics
Joshua Zelinsky, Tau Numbers: A Partial Proof of a Conjecture and Other Results , Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.8
|
|
MATHEMATICA
|
Do[If[IntegerQ[n/DivisorSigma[0, n]], Print[n]], {n, 1, 1000}]
Select[ Range[559], Mod[ #, DivisorSigma[0, # ]] == 0 &]
|
|
CROSSREFS
|
Cf. A000005, A039819, A036762, A051278, A051279, A051280, A036763.
Sequence in context: A020676 A086678 A066550 this_sequence A046526 A057529 A120737
Adjacent sequences: A033947 A033948 A033949 this_sequence A033951 A033952 A033953
|
|
KEYWORD
|
nice,nonn,easy
|
|
AUTHOR
|
Simon Colton (simonco(AT)cs.york.ac.uk)
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
|
Search completed in 0.003 seconds
|
