login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A320225
a(1) = 1; a(n > 1) = Sum_{k = 1..n} Sum_{d|k, d < k} a(d).
6
1, 1, 2, 4, 5, 9, 10, 16, 19, 26, 27, 44, 45, 57, 65, 87, 88, 120, 121, 158, 171, 200, 201, 278, 284, 331, 353, 426, 427, 536, 537, 646, 676, 766, 782, 982, 983, 1106, 1154, 1365, 1366, 1617, 1618, 1851, 1943, 2146, 2147, 2589, 2600, 2917, 3008, 3390, 3391
OFFSET
1,3
LINKS
FORMULA
a(1) = 1; a(n > 1) = Sum_{d = 1..n-1} a(d) * floor(n/d-1).
G.f. A(x) satisfies A(x) = x + (1/(1 - x)) * Sum_{k>=2} A(x^k). - Ilya Gutkovskiy, Sep 06 2019
MATHEMATICA
sau[n_]:=If[n==1, 1, Sum[sau[d], {k, n}, {d, Most[Divisors[k]]}]];
Table[sau[n], {n, 30}]
PROG
(Python)
from functools import lru_cache
@lru_cache(maxsize=None)
def A320225(n): return 1 if n == 1 else sum(A320225(d)*(n//d-1) for d in range(1, n)) # Chai Wah Wu, Jun 08 2022
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 07 2018
STATUS
approved