19350

Appears in sequences

• Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^10 in powers of x.at n=19A001488
• Numbers k such that k^2 and k^3 have the same set of digits.at n=25A029797
• Matrix 10th power of partition triangle A008284.at n=48A050304
• Triangle, read by rows, where T(n,k) equals the dot product of the vector of terms in row n that are to the right of T(n,k) with the vector of terms in column k that are above T(n,k): T(n,k) = Sum_{j=0..n-k-1} T(n,j+k+1)*T(j+k,k) for n > k+1 > 0, with T(n,n) = 1 and T(n,n-1) = n (n>=1).at n=37A115080
• Column 1 of triangle A115080.at n=7A115082
• Larger cube root in set of successive minima of A^(1/3) + B^(1/3) - C (A,B,C positive integers; A,B not cubes).at n=17A129376
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 1, -1), (1, -1, 1), (1, 1, 0)}.at n=9A148955
• Numbers that are representable in at least two ways as sums of four distinct nonvanishing cubes.at n=6A259060
• Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111.at n=9A261706
• a(n) = 2*n*(16*n - 13).at n=25A263228
• Number of pairs of orientable necklaces with n beads and up to 6 colors; i.e., turning the necklace over does not leave it unchanged. The turned-over necklace is not included in the count.at n=7A278642
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n), where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296271
• Numbers k such that k/10 + 1 is a square.at n=44A302576
• Expansion of x * (d/dx) Product_{k>=0} 1/(1 - x^(2^k)).at n=43A304909
• The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors.at n=72A309528
• Expansion of Product_{i>=1, j>=1, k>=1} (1 + i*j*k*x^(i*j*k)).at n=11A318482
• Number of inversion sequences of length n avoiding the consecutive pattern 102.at n=8A328500
• a(n) = Sum_{k=1..n} (-1)^(k-1) * binomial(floor(n/k)+3,4).at n=24A366659
• Number of lattice paths from (0,0) to (n,n) using steps (1,0),(4,0),(0,1).at n=8A383480
• Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.at n=1A385340