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 A086950 #23 Oct 09 2022 20:28:09
%S A086950 0,1,12,60,224,720,2112,5824,15360,39168,97280,236544,565248,1331200,
%T A086950 3096576,7127040,16252928,36765696,82575360,184287232,408944640,
%U A086950 902823936,1983905792,4341104640,9462349824,20552089600,44493176832,96032784384,206695301120,443723808768
%N A086950 Binomial transform of decagonal numbers A001107.
%H A086950 Vincenzo Librandi, <a href="/A086950/b086950.txt">Table of n, a(n) for n = 0..1000</a>
%H A086950 Milan Janjić, <a href="https://www.emis.de/journals/JIS/VOL21/Janjic2/janjic103.html">Pascal Matrices and Restricted Words</a>, J. Int. Seq., Vol. 21 (2018), Article 18.5.2.
%H A086950 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-12,8).
%F A086950 a(n) = n*2^n*(2*n-1)/2.
%F A086950 G.f.: x*(1+6*x)/(1-2*x)^3.
%F A086950 a(0)=0, a(1)=1, a(2)=12, a(n)=6*a(n-1)-12*a(n-2)+8*a(n-3). - _Harvey P. Dale_, Dec 13 2015
%F A086950 E.g.f.: exp(2*x)*x*(1 + 4*x). - _Stefano Spezia_, Oct 09 2022
%t A086950 LinearRecurrence[{6,-12,8},{0,1,12},30] (* _Harvey P. Dale_, Dec 13 2015 *)
%o A086950 (Magma) [n*2^n*(2*n-1)/2: n in [0..30] ]; // _Vincenzo Librandi_, Aug 22 2011
%Y A086950 Binomial transform is A086951.
%K A086950 easy,nonn
%O A086950 0,3
%A A086950 _Paul Barry_, Jul 24 2003