A334159 - OEIS

A334159

Irregular triangle read by rows: T(n,k) is the number of colorings of the n-hypercube graph using exactly k unlabeled colors, k = 1..2^n.

1, 0, 1, 0, 1, 2, 1, 0, 1, 18, 92, 146, 80, 16, 1, 0, 1, 494, 54583, 1507094, 12630906, 40096740, 58031885, 43419502, 18212138, 4498756, 670366, 60220, 3156, 88, 1, 0, 1, 197546, 5427041958, 17973998149410, 10961517110194516, 1450479305675145412, 56507865332978414188

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,6

LINKS

Andrew Howroyd, Table of n, a(n) for n = 0..62 (rows 0..5)

Andrew Howroyd, Chromatic Polynomials of Hypercubes Q_0 to Q_5

Eric Weisstein's World of Mathematics, Chromatic Polynomial

Eric Weisstein's World of Mathematics, Hypercube Graph

EXAMPLE

Triangle begins:

0 | 1;

1 | 0, 1;