19734
domain: N
Appears in sequences
- Expansion of Product_{k>=1} (1 - x^k)^13.at n=20A010820
- Distinct even elements in 4-Pascal triangle A028275 (by row).at n=35A028282
- Central elements in 4-Pascal triangle A028275 (by row).at n=8A028283
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5).at n=13A036887
- Partial sums of A051865.at n=22A050441
- Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height.at n=28A091958
- Cost of traversing complete tree of height n through splaying.at n=12A100624
- Fifth partial sums of cubes (A000578).at n=7A101102
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=35A166393
- Number of distinct sets of nonnegative integers with perimeter n, as defined in the comments.at n=49A182372
- a(n) = 6 * binomial(2*n,n-1) + binomial(2*n-1,n).at n=6A185080
- Rectangular array: (row n) = b**c, where b(h) = h, c(h) = binomial(2*n-4+2*h,n-2+h), n>=1, h>=1, and ** = convolution.at n=43A213853
- a(n) = denominator(B°(2*n))/4 where the B°(n) are Zagier's modified Bernoulli numbers.at n=11A216912
- Number of partitions p of n such that (number of even numbers in p) = 2*(number of odd numbers in p).at n=52A241643
- Least m > 0 such that gcd(m^n+11, (m+1)^n+11) > 1, or 0 if there is no such m.at n=43A255861
- a(n) = number of steps to reach 0 when starting from k = (n^3)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=54A261228
- a(n) = 3*(9*n - 1)*(3*n - 2).at n=16A277985
- Number of n X 4 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302318
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=41A302322
- Number of 6Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=3A302327