21375

Appears in sequences

• The Wiener index of the Kneser graph K(n,2) (n>=5).at n=15A228306
• Number of ways to place 2 points on a triangular grid of side n so that they are not adjacent.at n=18A239568
• Number of compositions of n such that the smallest part has multiplicity four.at n=14A241864
• Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=6A252143
• Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=2A252147
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=38A252148
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 777", based on the 5-celled von Neumann neighborhood.at n=14A290293
• Related to label-increasing forests with branching bounded by 3.at n=7A297198
• Number of nX3 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=5A298332
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=2A298335
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=30A298337
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=33A298337
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=2A299396
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=30A299398
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=33A299398
• Numbers k such that A001156(k) is divisible by k.at n=8A304046
• a(n) is the number of decompositions of H(n,1) into disjoint unions of H(j,k) where H(j,k) is the set of numbers { (2*i-1)*(2*k-1), 1 <= i <= j }.at n=34A336739
• Numbers k such that k and k+1 are products of at least 6 primes.at n=27A346207
• a(n) = Sum_{k=1..n} binomial(n*(m+1)-m*k-1, n-k)*k/(n*m-(m-1)*k), for m=7.at n=6A376447
• E.g.f. satisfies A(x) = (1 + x * exp(x*A(x)))^3.at n=5A377578