login
A116137
a(0) = 1 and a(n) = a(n-1) + A116212(n), where A116212 is the list of the positive divisors of each term of this sequence.
2
1, 2, 3, 5, 6, 9, 10, 15, 16, 18, 21, 27, 28, 31, 40, 41, 43, 48, 58, 59, 62, 67, 82, 83, 85, 89, 97, 113, 114, 116, 119, 125, 134, 152, 153, 156, 163, 184, 185, 188, 197, 224, 225, 227, 231, 238, 252, 280, 281, 312, 313, 315, 319, 324, 332, 342, 362, 402, 403, 444
OFFSET
0,2
LINKS
EXAMPLE
a(11) = a(10) + A116212(11).
A116212 begins: 1;1,2;1,3;1,5;1,2,3,6;1,3,9;...
So a(11) = 21 + 6 = 27.
PROG
(Python)
from sympy import divisors
def A116137_list(max_n):
A, z = [1], 0
while len(A) <= max_n:
A.extend((A[-1]+d) for d in divisors(A[z])); z += 1
return(A[:max_n+1]) # John Tyler Rascoe, Nov 26 2023
CROSSREFS
Cf. A116212.
Sequence in context: A025523 A173382 A128689 * A178611 A293976 A173492
KEYWORD
nonn,easy
AUTHOR
Leroy Quet, Apr 08 2007
EXTENSIONS
More terms from R. J. Mathar, Aug 31 2007
Edited by John Tyler Rascoe, Nov 26 2023
STATUS
approved