24301

Appears in sequences

• 7-dimensional centered tetrahedral numbers.at n=9A008501
• Number of (partially defined) monotone maps from intervals of 1..n to 1..n.at n=7A048775
• Numbers n such that n = pi(n)*k + 1 for some k.at n=30A065136
• Expansion of 1/(1-x+2*x^2-x^3) in powers of x.at n=36A077954
• Expansion of 1/(1+x+2*x^2+x^3).at n=36A077979
• Triangle read by rows, T(n, k) = [x^k] (1-x)^(n+1)*Sum_{j=0..n} binomial(n + n*j + j, n*j + j)*x^j.at n=37A108267
• Triangle read by rows, T(n, k) = [x^k] (1-x)^(n+1)*Sum_{j=0..n} binomial(n + n*j + j, n*j + j)*x^j.at n=43A108267
• Semiprimes in A056107.at n=23A113525
• Number triangle read by rows: T(n,k) = Sum_{j=0..n-k} C(n+j,j+k)*C(n-j,k).at n=37A117207
• a(n) = Sum_{k=0..n} (-1)^k * binomial(n, k) * A000931(n-k+4).at n=19A144413
• Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.at n=47A144512
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 0110-0100-1111 pattern in any orientation.at n=11A146792
• a(1)=0, a(n) = n^3 - a(n-1).at n=35A153026
• a(n) = 900*n + 1.at n=26A158407
• Row sums of number triangle A185962.at n=24A185963
• Number of nX2 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=6A209361
• T(n,k) = Number of n X k 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=29A209365
• T(n,k) = Number of n X k 1..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=34A209365
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.at n=28A222555
• Number of partitions p of n such that median(p) >= multiplicity(max(p)).at n=38A240211