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 A152041 #19 Aug 18 2025 00:47:56
%S A152041 0,4,33,129,355,795,1554,2758,4554,7110,10615,15279,21333,29029,38640,
%T A152041 50460,64804,82008,102429,126445,154455,186879,224158,266754,315150,
%U A152041 369850,431379,500283,577129,662505,757020,861304,976008,1101804,1239385,1389465,1552779
%N A152041 a(n) = A008893(n)/2.
%H A152041 Nathaniel Johnston, <a href="/A152041/b152041.txt">Table of n, a(n) for n = 0..10000</a>
%H A152041 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A152041 a(n) = n*(n+1)*(7*n^2+7*n+2)/8.
%F A152041 G.f.: -x*(4*x^2+13*x+4)/(x-1)^5.
%F A152041 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5). - _Harvey P. Dale_, Jul 20 2011
%F A152041 E.g.f.: x*(2 + x)*(16 + 42*x + 7*x^2)*exp(x)/8. - _Elmo R. Oliveira_, Aug 15 2025
%t A152041 Table[n(n+1)(7n^2+7n+2)/8,{n,0,40}] (* or *) LinearRecurrence[ {5,-10,10,-5,1},{0,4,33,129,355},40] (* _Harvey P. Dale_, Jul 20 2011 *)
%o A152041 (Maxima) A152041(n):=n*(n+1)*(7*n^2+7*n+2)/8$
%o A152041 makelist(A152041(n),n,0,30); /* _Martin Ettl_, Nov 03 2012 */
%Y A152041 Cf. A008893.
%K A152041 nonn,easy
%O A152041 0,2
%A A152041 _M. F. Hasler_, Sep 15 2009
%E A152041 Extended and edited by _Nathaniel Johnston_, May 05 2011