24626

Appears in sequences

• Number of discordant permutations.at n=5A000563
• a(0) = 1, a(n) = 19*n^2 + 2 for n>0.at n=36A010009
• Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.at n=39A049020
• Decimal concatenations of the 38 quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5).at n=1A078870
• Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_2 graph (C_n is the cycle graph on n vertices and P_2 is the path graph on 2 vertices).at n=57A102079
• Base-10 encoding of the Spanish name of n with one digit per letter as on a touch-tone telephone.at n=5A165948
• Sum of all parts minus the total numbers of parts of all partitions of n.at n=23A196087
• Numbers k such that 3^k + 34 is prime.at n=30A219050
• Number of unbalanced partitions of n: the largest part is not equal to the number of parts.at n=37A236634
• Triangle read by rows: T(n,k) = Sum_{j=k..n} binomial(n,j)*Stirling_2(j,k)*Bell(n-j), where Bell(n) = A000110(n), for n >= 1, 0 <= k <= n-1.at n=31A244489
• Number of (2+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=11A250770
• Triangle T(n,k) of the numbers of k-matchings in the n-Moebius ladder (0 <= k <= n, n > 2).at n=54A302232
• Number of partitions of n into at most 1^2 copy of 1, 2^2 copies of 2, 3^2 copies of 3, ... .at n=46A303944
• E.g.f.: exp(exp(x) - 1) * (exp(x) - 1)^3 / 3!.at n=5A346842