This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A100454 #7 Apr 08 2023 02:28:47 %S A100454 1,7,24,58,109,188,307,444,641,885,1149,1493,1936,2358,2975,3645,4267, %T A100454 5102,6057,6941,8124,9395,10458,12140,13561,15336,17110,19204,21124, %U A100454 23596,26219,28587,31254,34593,37252,40545,44524,47451,51724,55853,60068,64152,69801,73657,79372 %N A100454 a(n) = sum of n-th column in array in A100452. %H A100454 G. C. Greubel, <a href="/A100454/b100454.txt">Table of n, a(n) for n = 1..1000</a> %t A100454 t[1, n_]:= n^2; (* t = A100452 *) %t A100454 t[m_, n_]/; 1<m<=n:= t[m,n]= (n-m+1)*Floor[(t[m-1,n] -1)/(n-m+1)]; %t A100454 t[_, _]=0; %t A100454 A100454[n_]:= A100454[n]= Sum[t[n-k+1,n], {k,n}]; %t A100454 Table[A100454[n], {n, 60}] (* _G. C. Greubel_, Apr 07 2023 *) %o A100454 (Magma) %o A100454 function t(n, k) // t = A100452 %o A100454 if k eq 1 then return n^2; %o A100454 else return (n-k+1)*Floor((t(n, k-1) -1)/(n-k+1)); %o A100454 end if; %o A100454 end function; %o A100454 A100454:= func< n | (&+[t(n,n-k+1): k in [1..n]]) >; %o A100454 [A100454(n): n in [1..60]]; // _G. C. Greubel_, Apr 07 2023 %o A100454 (SageMath) %o A100454 def t(n, k): # t = A100452 %o A100454 if (k==1): return n^2 %o A100454 else: return (n-k+1)*((t(n, k-1) -1)//(n-k+1)) %o A100454 def A100454(n): return sum(t(n,n-k+1) for k in range(1,n+1)) %o A100454 [A100454(n) for n in range(1,61)] # _G. C. Greubel_, Apr 07 2023 %Y A100454 Cf. A100452. %K A100454 nonn %O A100454 1,2 %A A100454 _N. J. A. Sloane_, Nov 22 2004 %E A100454 Terms a(26) onward added by _G. C. Greubel_, Apr 07 2023