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 A219070 #19 Jan 26 2022 12:38:45
%S A219070 0,3,69,467,1858,5479,13327,28343,54596,97467,163833,262251,403142,
%T A219070 598975,864451,1216687,1675400,2263091,3005229,3930435,5070666,
%U A219070 6461399,8141815,10154983,12548044,15372395,18683873,22542939,27014862,32169903,38083499,44836447
%N A219070 a(n) = (46*n^5 + 30*n^4 + 15*n^3 - n) / 30.
%C A219070 For n > 0: row sums of the triangle A219069.
%H A219070 Reinhard Zumkeller, <a href="/A219070/b219070.txt">Table of n, a(n) for n = 0..1000</a>
%F A219070 a(n) = A000584(n) + A000290(n)*A000330(n) + A000538(n).
%t A219070 Table[(46n^5 + 30n^4 + 15n^3 - n)/30, {n, 0, 39}] (* _Alonso del Arte_, Nov 12 2012 *)
%o A219070 (Haskell)
%o A219070 a219070 n = n * (n * (n * (n * (46 * n + 30) + 15)) - 1) `div` 30 -- _Reinhard Zumkeller_
%o A219070 (Maxima) A219070(n):=(46*n^5 + 30*n^4 + 15*n^3-n)/30$
%o A219070 makelist(A219070(n),n,0,30); /* _Martin Ettl_, Nov 12 2012 */
%Y A219070 Cf. A000290, A000330, A000538, A000584, A219069.
%K A219070 nonn,easy
%O A219070 0,2
%A A219070 _Reinhard Zumkeller_, Nov 11 2012