|
Search: id:A069016
|
|
|
| A069016 |
|
Number of distinct sums of factorizations of n. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 4, 1, 3, 2, 2, 1, 5, 2, 2, 3, 3, 1, 5, 1, 4, 2, 2, 2, 7, 1, 2, 2, 5, 1, 5, 1, 3, 4, 2, 1, 8, 2, 4, 2, 3, 1, 7, 2, 5, 2, 2, 1, 9, 1, 2, 4, 6, 2, 5, 1, 3, 2, 5, 1, 10, 1, 2, 4, 3, 2, 5, 1, 8, 5, 2, 1, 8, 2, 2, 2, 5, 1, 10, 2, 3, 2, 2, 2, 12, 1, 4, 4, 7, 1, 5, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
REFERENCES
|
Amarnath Murthy, Generalization of Partition Function and Introducing Smarandache Factor Partitions, Smarandache Notions Journal, Vol. 11, 1-2-3. Spring 2000.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
The factorizations of 30 are (2,3,5), (2,15), (3,10), (5,6) and (30), which have the 5 distinct sums 10, 17, 13, 11 and 30. Hence a(30) = 5.
|
|
CROSSREFS
|
Cf. A034891.
Sequence in context: A118824 A082641 A138553 this_sequence A071414 A067148 A035228
Adjacent sequences: A069013 A069014 A069015 this_sequence A069017 A069018 A069019
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 01 2002
|
|
EXTENSIONS
|
Edited by David W. Wilson, May 27, 2002
|
|
|
Search completed in 0.002 seconds
|
