cp's OEIS Frontend

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.

A321982 Row n gives the chromatic symmetric function of the n-ladder, expanded in terms of elementary symmetric functions and ordered by Heinz number.

This page as a plain text file.
%I A321982 #8 Aug 23 2023 10:17:48
%S A321982 2,0,12,2,0,0,0,54,26,16,0,2,0,0,0,0,0,0,216,120,168,84,0,24,40,32,0,
%T A321982 0,2,0,0,0,0,0,0,0,0,0,0,0,810,648,822,56,240,870,280,282,120,24,0,
%U A321982 266,232,0,48,0,54,0,48,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0
%N A321982 Row n gives the chromatic symmetric function of the n-ladder, expanded in terms of elementary symmetric functions and ordered by Heinz number.
%C A321982 The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
%C A321982 A stable partition of a graph is a set partition of the vertices where no edge has both ends in the same block. The chromatic symmetric function is given by X_G = Sum_p m(t(p)) where the sum is over all stable partitions of G, t(p) is the integer partition whose parts are the block-sizes of p, and m is augmented monomial symmetric functions (see A321895).
%C A321982 The n-ladder has 2*n vertices and looks like:
%C A321982   o-o-o-   -o
%C A321982   | | | ... |
%C A321982   o-o-o-   -o
%C A321982 Conjecture: All terms are nonnegative (verified up to the 5-ladder).
%H A321982 Richard P. Stanley, <a href="http://www-math.mit.edu/~rstan/pubs/pubfiles/100.pdf">A symmetric function generalization of the chromatic polynomial of a graph</a>, Advances in Math. 111 (1995), 166-194.
%H A321982 Richard P. Stanley, <a href="http://www-math.mit.edu/~rstan/papers/taor.pdf">Graph colorings and related symmetric functions: ideas and applications</a>, Discrete Mathematics 193 (1998), 267-286.
%H A321982 Gus Wiseman, <a href="http://arxiv.org/abs/0709.0430">Enumeration of paths and cycles and e-coefficients of incomparability graphs</a>, arXiv:0709.0430 [math.CO], 2007.
%e A321982 Triangle begins:
%e A321982     2   0
%e A321982    12   2   0   0   0
%e A321982    54  26  16   0   2   0   0   0   0   0   0
%e A321982   216 120 168  84   0  24  40  32   0   0   2   0   0   [+9 more zeros]
%e A321982 For example, row 3 gives: X_L3 = 54e(6) + 26e(42) + 16e(51) + 2e(222).
%Y A321982 Row sums are A109808.
%Y A321982 Cf. A000569, A001187, A006125, A056239, A229048, A240936, A245883, A277203, A321911, A321918, A321914, A321979, A321980, A321981.
%K A321982 nonn,tabf
%O A321982 1,1
%A A321982 _Gus Wiseman_, Nov 23 2018