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 A190705 #23 Sep 08 2022 08:45:57
%S A190705 0,18,120,378,864,1650,2808,4410,6528,9234,12600,16698,21600,27378,
%T A190705 34104,41850,50688,60690,71928,84474,98400,113778,130680,149178,
%U A190705 169344,191250,214968,240570,268128,297714,329400
%N A190705 a(n) = 6*n^2*(2*n + 1).
%C A190705 Number of partitions of 12*n + 1 into 4 parts.
%H A190705 Vincenzo Librandi, <a href="/A190705/b190705.txt">Table of n, a(n) for n = 0..1000</a>
%H A190705 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A190705 a(n) = 6 * A099721(n).
%F A190705 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4); a(0)=0, a(1)=18, a(2)=120, a(3)=378. - _Harvey P. Dale_, Mar 20 2016
%e A190705 a(1)=18: there are 18 partitions of 12*1+1=13 into 4 parts:
%e A190705 [1,1,1,10], [1,1,2,9], [1,1,3,8], [1,1,4,7], [1,1,5,6],
%e A190705 [1,2,2,8], [1,2,3,7], [1,2,4,6], [1,2,5,5], [1,3,3,6],
%e A190705 [1,3,4,5], [1,4,4,4], [2,2,2,7], [2,2,3,6], [2,2,4,5],
%e A190705 [2,3,3,5], [2,3,4,4], [3,3,3,4].
%t A190705 Table[6n^2(2n + 1), {n, 0, 30}]
%t A190705 LinearRecurrence[{4,-6,4,-1},{0,18,120,378},40] (* _Harvey P. Dale_, Mar 20 2016 *)
%o A190705 (Magma) [6*n^2*(2*n+1): n in [0..40]]; // _Vincenzo Librandi_, Jun 14 2011
%o A190705 (PARI) a(n)=6*n^2*(2*n+1) \\ _Charles R Greathouse IV_, Aug 05 2013
%K A190705 nonn,easy
%O A190705 0,2
%A A190705 _Adi Dani_, Jun 14 2011