|
Search: id:A117552
|
|
|
| A117552 |
|
Largest partial sum of the increasingly ordered divisors of n, not exceeding n. |
|
+0
2
|
|
| 1, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 10, 1, 10, 9, 15, 1, 12, 1, 12, 11, 14, 1, 24, 6, 16, 13, 28, 1, 27, 1, 31, 15, 20, 13, 25, 1, 22, 17, 30, 1, 33, 1, 40, 33, 26, 1, 36, 8, 43, 21, 46, 1, 39, 17, 36, 23, 32, 1, 58, 1, 34, 41, 63, 19, 45, 1, 58, 27, 39, 1, 63, 1, 40, 49, 64, 19, 51, 1, 66
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
a(12)=10 because the increasingly ordered divisors of 12 are 1,2,3,4,6, and 12, with partial sums 1,3,6,10,16, and 28; the largest partial sum not exceeding 12 is 10.
|
|
MAPLE
|
with(numtheory): a:=proc(n) local div, j: if n=1 then 1 else div:=divisors(n): for j from 1 by 1 while sum(div[i], i=1..j)<=n do sum(div[k], k=1..j) od: fi: end: seq(a(n), n=1..90); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2006
|
|
CROSSREFS
|
Cf. A117553.
Sequence in context: A111614 A076889 A134689 this_sequence A069250 A001065 A109646
Adjacent sequences: A117549 A117550 A117551 this_sequence A117553 A117554 A117555
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Mar 28 2006
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2006
|
|
|
Search completed in 0.002 seconds
|
