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 A264445 #14 Sep 08 2022 08:46:14
%S A264445 0,46,104,175,260,360,476,609,760,930,1120,1331,1564,1820,2100,2405,
%T A264445 2736,3094,3480,3895,4340,4816,5324,5865,6440,7050,7696,8379,9100,
%U A264445 9860,10660,11501,12384,13310,14280,15295,16356,17464,18620,19825,21080
%N A264445 a(n) = n*(n + 11)*(n + 22)/6.
%C A264445 It is well-known, and easy to prove, that the product of 3 consecutive integers n*(n + 1)*(n + 2) is divisible by 6. It can be shown that the product of 3 integers in arithmetic progression n*(n + r)*(n + 2*r) is divisible by 6 if and only if r is not divisible by 2 or 3 (see A007310 for these numbers). This is the case r = 11.
%H A264445 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A264445 O.g.f.: x*(35*x^2 - 80*x + 46)/(1 - x)^4.
%F A264445 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4) for n>3. - _Vincenzo Librandi_, Nov 16 2015
%p A264445 seq( n*(n + 11)*(n + 22)/6, n = 0..40 );
%t A264445 Table[n (n + 11) (n + 22)/6, {n, 0, 40}] (* _Vincenzo Librandi_, Nov 16 2015 *)
%t A264445 LinearRecurrence[{4,-6,4,-1},{0,46,104,175},50] (* _Harvey P. Dale_, Dec 11 2018 *)
%o A264445 (PARI) vector(100, n, n--; n*(n+11)*(n+22)/6) \\ _Altug Alkan_, Nov 15 2015
%o A264445 (Magma) [n*(n+11)*(n+22)/6: n in [0..40]]; // _Vincenzo Librandi_, Nov 16 2015
%Y A264445 Cf. A007310, A264443, A264444, A264446, A264447, A264448, A264449, A264450.
%K A264445 nonn,easy
%O A264445 0,2
%A A264445 _Peter Bala_, Nov 13 2015