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”).
%I #10 Mar 31 2021 19:10:02
%S 1,1,1,6,20,53,130,277,574,1115,2126,3862,7021,12341,21553,36957,
%T 63111,106224,178407,296638,492231,811731,1335994,2188950,3583027,
%U 5847108,9532980,15512342,25226123,40967842,66506422,107869832,174908573,283452771,459264017
%N a(n) = 2*a(n-1) - a(n-3) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 1, a(2) = 1.
%C a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio (A001622), so that (a(n)) has the growth rate of the Fibonacci numbers (A000045). See A298338 for a guide to related sequences.
%H Clark Kimberling, <a href="/A298408/b298408.txt">Table of n, a(n) for n = 0..1000</a>
%t a[0] = 1; a[1] = 1; a[2] = 1;
%t a[n_] := a[n] = 2*a[n - 1] - a[n - 3] + Sum[k*a[Floor[n/k]], {k, 2, n}];
%t Table[a[n], {n, 0, 90}] (* A298408 *)
%o (Python)
%o from functools import lru_cache
%o @lru_cache(maxsize=None)
%o def A298408(n):
%o if n <= 2:
%o return 1
%o c, j = 2*A298408(n-1)-A298408(n-3), 2
%o k1 = n//j
%o while k1 > 1:
%o j2 = n//k1 + 1
%o c += (j2*(j2-1)-j*(j-1))*A298408(k1)//2
%o j, k1 = j2, n//j2
%o return c+(n*(n+1)-j*(j-1))//2 # _Chai Wah Wu_, Mar 31 2021
%Y Cf. A001622, A000045, A298338, A298409.
%K nonn,easy
%O 0,4
%A _Clark Kimberling_, Feb 10 2018