51051

Appears in sequences

• Number of n-step mappings with 4 inputs.at n=26A005945
• Expansion of 1/((1-2x)(1-8x)(1-11x)).at n=4A016318
• Odd numbers with exactly 5 distinct prime factors.at n=21A046391
• Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x).at n=42A062991
• Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 5 distinct prime factors and n is squarefree.at n=12A071144
• a(n) = n!/(1!*2!*3!*...*k!) where k is the largest integer such that 1!*2!*3!*...*k! divides n!.at n=17A074199
• Smallest x such that A061498(x)=n: least number in dRRS of which n distinct term occur.at n=8A076362
• Repeated terms in A087657 (a(n) = |prime(n)-a(n-1)| + |prime(n)-a(n-2)| + |prime(n)-a(n-3)| ).at n=8A087658
• a(n) = (A093886(n))! / (1!*2!*3!*...*n!).at n=6A093887
• Triangle read by rows: T(n, k) = binomial(2*n, k-1)*binomial(2*n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0^n.at n=48A094385
• a(1) = 1, a(n+1) = prime(n)*Digit reversal of a(n).at n=7A095198
• a(n) = A111877(n+1)/5.at n=6A111878
• a(0)=1, a(1)=1, a(n) = 11*a(n/2) for even n, and a(n) = 10*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=30A116525
• Triangle T(n,k), 0 <= k <= n, defined by : T(n,k) = 0 if k < 0, T(0,k) = 0^k, (n+2)*(2*n-2*k+1)*T(n,k) = (2*n+1)*( 4*(2*n-2*k+1)*T(n-1,k-1) + (n+2*k+2)*T(n-1,k) ).at n=24A123382
• From the game of Quod: number of "squares" on an n X n array of points with the four corner points deleted.at n=26A124479
• Triangular table of numerators of the coefficients of Laguerre-Sonin polynomials L(1/2,n,x).at n=38A131440
• a(n) = core(A143176(n)).at n=53A144362
• Denominator of the polynomial A_l(x) = sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=4.at n=8A145616
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=32A146960
• Numerators in expansion of (1-x)^(-7/2).at n=6A161201