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 A365675 #8 Sep 17 2023 02:02:48 %S A365675 1,1,4,8,18,30,58,90,153,233,365,533,806,1142,1652,2308,3243,4431, %T A365675 6103,8203,11080,14710,19540,25612,33612,43570,56476,72548,93080, %U A365675 118490,150699,190315,240046,301042,376887,469515,583993,723073,893815,1100615,1352888 %N A365675 a(n) = Sum_{k=0..n} p(k) where the p(k) are the partial sums of row n of A365676. %C A365675 If one reverses row n in the definition formula before accumulating, one gets A000070. %o A365675 (Python) # Using function A365676Row from A365676. %o A365675 from itertools import accumulate %o A365675 def A365675List(size: int) -> list[int]: %o A365675 return [sum(accumulate(A365676Row(n))) for n in range(size)] %o A365675 print(A365675List(41)) %Y A365675 Cf. A365676, A000070. %K A365675 nonn %O A365675 0,3 %A A365675 _Peter Luschny_, Sep 16 2023