28722

Appears in sequences

• McKay-Thompson series of class 28D for Monster.at n=36A058609
• Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes.at n=8A076281
• Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.at n=40A084268
• Least k such that decimal representation of k*n contains only digits 0 and 6.at n=22A096685
• Triangle read by rows: let a(n,k) = number of graphs on n nodes with chromatic number k; T(n,k) = a(n,n-k), n >= 2, k=0..n-2.at n=32A115597
• The number of pairs of permutations in the product group S_n X S_n with k common descents, n >= 1 and 0 <= k <= n-1.at n=18A192721
• Number of 0..3 arrays of length n+7 with sum less than 12 in any length 6 subsequence (=less than 50% duty cycle).at n=0A213460
• T(n,k)=Number of 0..3 arrays of length n+2*k-1 with sum less than 3*k in any length 2k subsequence (=less than 50% duty cycle).at n=6A213464
• Number of 0..3 arrays of length 2*n with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle).at n=3A213465
• Number of length n+7 0..3 arrays with at most two downsteps in every 7 consecutive neighbor pairs.at n=0A255659
• T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=21A255660
• Number of length n+1 0..3 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=6A255661
• Expansion of Product_{k>=0} ((1+x^(3*k+1))/(1-x^(3*k+1)))^3.at n=17A261651
• Triangle read by rows, (Sum_{k=0..n} T[n,k]*x^k) / (1-x)^(n+1) are generating functions of the columns of A287316.at n=24A287315
• Number of nonequivalent directed unicursal star polygons (no edge joins adjacent vertices) that can be formed by connecting the vertices of a regular n-gon up to rotations.at n=10A370068