|
Search: id:A061017
|
|
|
| A061017 |
|
n appears d(n) times where d(n) [A000005] is the number of divisors of n. |
|
+0
4
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 24
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The union of N, 2N, 3N, ..., where N = {1,2,3,4,5,6,...}.
Considering the maximal rectangle in each of the Ferrers graphs of partitions of n, a(n) is the smallest such maximal rectangle; a(n) is also an inverse of A006218. - Henry Bottomley (se16(AT)btinternet.com), Mar 11 2002
The numbers in A003991 in numerical order. - Matthew Vandermast (ghodges14(AT)comcast.net), Feb 28 2003
|
|
MATHEMATICA
|
Flatten[Table[Table[n, {Length[Divisors[n]]}], {n, 1, 30}]]
|
|
CROSSREFS
|
Cf. A000005.
Sequence in context: A084557 A060021 A000006 this_sequence A088462 A093337 A120397
Adjacent sequences: A061014 A061015 A061016 this_sequence A061018 A061019 A061020
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jont Allen (jba(AT)research.att.com), May 25 2001
|
|
EXTENSIONS
|
More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 01 2001
|
|
|
Search completed in 0.002 seconds
|
