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 A134239 #9 Nov 15 2014 16:10:51 %S A134239 1,4,2,6,9,3,8,20,16,4,10,35,45,25,5,12,54,96,84,36,6,14,77,175,210, %T A134239 140,49,7,16,104,288,440,400,216,64,8,18,135,441,819,945,693,315,81,9, %U A134239 20,170,640,1400,1960,1820,1120,440,100,10 %N A134239 A127899(unsigned) * A007318. %H A134239 Reinhard Zumkeller, <a href="/A134239/b134239.txt">Rows n = 0..125 of triangle, flattened</a> %F A134239 A127899(unsigned) * A007318. %F A134239 Triangle, T(n,k) = (n+1) * A029635(n,n-k) for n > 0. %e A134239 First few rows of the triangle are: %e A134239 1; %e A134239 4, 2; %e A134239 6, 9, 3; %e A134239 8, 20, 16, 4; %e A134239 10, 35, 45, 25, 5; %e A134239 12, 54, 96, 84, 36, 6; %e A134239 14, 77, 175, 210, 140, 49, 7; %e A134239 ... %e A134239 Row 3 = (8, 20, 16, 4) = 4 * (2, 5, 4, 1), where (2, 5, 4, 1) = row 3 of A029653, (2,1) Pascal's triangle. %o A134239 (Haskell) %o A134239 a134239 n k = a134239_tabl !! n !! k %o A134239 a134239_row n = a134239_tabl !! n %o A134239 a134239_tabl = [1] : zipWith (map . (*)) %o A134239 [2..] (map reverse $ tail a029635_tabl) %o A134239 -- _Reinhard Zumkeller_, Nov 14 2014 %Y A134239 Cf. A127899, A029653, A128543 (row sums). %K A134239 nonn,tabl %O A134239 0,2 %A A134239 _Gary W. Adamson_, Oct 14 2007 %E A134239 Corrected by _Philippe Deléham_, Oct 17 2007 %E A134239 Formula corrected by _Reinhard Zumkeller_, Nov 14 2014