271320

Appears in sequences

• a(n) = 5*binomial(n, 6).at n=21A000910
• Expansion of 1/((1-2x)(1-3x)(1-7x)(1-8x)).at n=5A025943
• Aliquot sequence starting at 840 (reaches 1 at 747th term).at n=7A045477
• Partial sums of A051923.at n=14A050494
• a(n) = (3*n+3)!/(3*n!*(2*n+2)!).at n=6A090763
• Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.at n=19A092006
• Eighth column of (1,5)-Pascal triangle A096940.at n=14A096945
• Start with a(1)=1; now a(n+1)=a(n)+a(k) with k=[n-n-th digit of Pi]. If k<0 or k=0, then a(k)=0.at n=48A133389
• Numbers with prime factorization p*q*r*s*t*u^3 (where p, q, r, s, t, u are distinct primes).at n=9A190378
• Number of paths from (0,0) to (n,n) that use E(1,0) and N(0,1) as steps and have odd number of East steps below the line y=x-1.at n=11A268214
• Number of different 3 against 3 matches given n players.at n=19A271040
• Numbers n such that the multiplicative group modulo n is the direct product of 7 cyclic groups.at n=9A272597
• Triangle read by rows. T(n, k) = (1/2) * C(n, k) * C(3*n - 1, n) for n > 0 and T(0, 0) = 1.at n=29A360560
• Triangle read by rows. T(n, k) = (1/2) * C(n, k) * C(3*n - 1, n) for n > 0 and T(0, 0) = 1.at n=34A360560
• a(n) = 1680 * (3*n)!/((2*n)!*(n+3)!).at n=7A361038
• Infinitary aliquot sequence starting at 840: a(1) = 840, a(n) = A126168(a(n-1)), for n >= 2.at n=7A361421
• Triangle read by rows: T(n, k) = binomial(n, k)*binomial(2*n+k, k), 0 <= k <= n.at n=34A370258
• G.f. A(x) satisfies A(x) = 1 + x^4*(1+x)*A(x)^3.at n=31A375691