21248

Appears in sequences

• Expansion of (theta_3(z)*theta_3(19z) + theta_2(z)*theta_2(19z))^4.at n=30A028644
• Triangle, T(n, k) = (1/2)*(n+2)! * [x^k]( p(x, n) ), where p(x,0) = 1, p(x,1) = -x, P(x, n) = (1/(n+1))*( (2*n-x)*P(x, n-1) - n*P(x, n-2) ), read by rows.at n=22A136532
• Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + 11*T(n-2, k-1), read by rows.at n=17A153521
• Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + 11*T(n-2, k-1), read by rows.at n=18A153521
• Partial sums of A036967.at n=18A176273
• Products of the 8th power of a prime and a distinct prime (p^8*q).at n=22A179668
• a(n) = smallest number k such that k is divisible by 2^n, k+1 is divisible by 3^n and k+2 is divisible by 5^n.at n=2A181682
• a(n) = start of n consecutive numbers divisible respectively by prime(k)^n, for k=1..n.at n=2A185681
• Triangle of coefficients of polynomials v(n,x) jointly generated with A207629; see the Formula section.at n=50A207630
• Even numbers in A221715.at n=36A213218
• T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero.at n=46A231049
• Number of 2 X n 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero.at n=8A231050
• Number of partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is a part.at n=45A241442
• Values of n such that there are exactly 7 solutions to x^2 - y^2 = n with x > y >= 0.at n=33A257414
• Numbers n such that A048720(n, A065621(n)) is a perfect square, but n is not in A023758.at n=14A277807
• Binomial transform of the centered triangular numbers A005448.at n=9A295288
• G.f.: A(x) = Sum_{n>=0} binomial(3*(n+1), n)/(n+1) * x^n / (1+x)^(2*(n+1)).at n=9A316371
• Indices of unique values in A329152.at n=23A333268
• Triangle T(n,k) whose k-th column is the k-fold self-convolution of the primes; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=63A340991
• a(n) is the least term in A007602 such that the product of digits equals A342950(n) or 0 if no such number exists.at n=41A342952