20270

Appears in sequences

• Distinct compositions of the complete graph on n+2 vertices with one edge removed (K^-_{n+2}).at n=7A078468
• Triangle read by rows: number of labeled partitions of n with maximin m.at n=52A113547
• Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=40A117455
• Number of n-digit numbers N such that the reversal of N divides N.at n=7A222811
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=18A252377
• a(n) = floor( prime(n)^3 / (n*log(n)) ).at n=30A259648
• Expansion of phi(-q^6) / phi(-q) in powers of q where phi() is a Ramanujan theta function.at n=25A262968
• Number of set partitions of [n] such that for each block all absolute differences between consecutive elements are <= seven.at n=9A287279
• Number of nX3 0..1 arrays with every element equal to 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=22A298095
• Sum over all permutations of [n] of the maximum of the lengths of increasing or decreasing subsequences.at n=6A321273
• Number of necklace compositions of n with no part circularly followed by a divisor.at n=34A328600
• Triangle read by rows: T(n,m), n >= 1, 1 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=37A362924
• Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=47A362925
• Triangle read by rows: A113547 without its main diagonal.at n=43A362926