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 A098494 #25 Feb 04 2023 10:17:21 %S A098494 1,1,-1,1,-5,4,1,-12,35,-30,1,-22,143,-362,312,1,-35,405,-2065,4814, %T A098494 -4200,1,-51,925,-7965,35434,-78744,69120,1,-70,1834,-24010,173929, %U A098494 -709240,1525236,-1345680,1,-92,3290,-61040,655529,-4235588,16255420,-34148400,30240000 %N A098494 Triangle read by rows: coefficients of polynomials E(n,x) related to partitions with parts occurring at most thrice. %C A098494 The polynomials generate (-1)^k*n! times the diagonals of A098493. %H A098494 Seiichi Manyama, <a href="/A098494/b098494.txt">Rows n = 0..139, flattened</a> %H A098494 Alex Fink, Richard K. Guy, and Mark Krusemeyer, <a href="https://cdm.ucalgary.ca/article/view/61940">Partitions with parts occurring at most thrice</a>, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114. %F A098494 E(n+1,x+1) - E(n+1,x) = (n+1) * ( E(n,x) - n * E(n-1,x-1) ). %e A098494 E(0,x) = 1 %e A098494 E(1,x) = x - 1 %e A098494 E(2,x) = x^2 - 5*x + 4 %e A098494 E(3,x) = x^3 - 12*x^2 + 35*x - 30 %e A098494 E(4,x) = x^4 - 22*x^3 + 143*x^2 - 362*x + 312 %e A098494 E(5,x) = x^5 - 35*x^4 + 405*x^3 - 2065*x^2 + 4814*x - 4200 %Y A098494 Columns include -A000326. %Y A098494 Constant terms E(n, 0) = -E(n-1, -1) = n!/2*A085455 = (-1)^n*n!*A005773. %Y A098494 Row sums are E(n, 1) = (-1)^n*n!*A005774(n-2). [corrected by _Seiichi Manyama_, Feb 04 2023] %K A098494 sign,tabl %O A098494 0,5 %A A098494 _Ralf Stephan_, Sep 12 2004