|
Search: id:A093035
|
|
|
| A093035 |
|
Number of triples (d1,d2,d3) where each element is a divisor of n and d1 + d2 + d3 <= n. |
|
+0
1
|
|
| 0, 0, 1, 4, 1, 17, 1, 20, 8, 20, 1, 103, 1, 20, 27, 54, 1, 109, 1, 112, 27, 20, 1, 315, 8, 20, 27, 112, 1, 315, 1, 112, 27, 20, 27, 481, 1, 20, 27, 324, 1, 321, 1, 112, 125, 20, 1, 695, 8, 112, 27, 112, 1, 321, 27, 324, 27, 20, 1, 1285, 1, 20
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
a(9) = 8 because the divisors of 9 are {1,3,9} making the valid triples (1,1,1), (1,1,3), (1,3,1), (1,3,3), (3,1,1), (3,1,3), (3,3,1), (3,3,3)
|
|
CROSSREFS
|
Sequence in context: A002568 A111661 A072651 this_sequence A126791 A052179 A126331
Adjacent sequences: A093032 A093033 A093034 this_sequence A093036 A093037 A093038
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan A. Cohen (cohenj02(AT)tartarus.uwa.edu.au), May 08 2004
|
|
|
Search completed in 0.002 seconds
|
