18424

Appears in sequences

• a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=24A000447
• Generalized Stirling numbers, [n+5,5]_2.at n=4A001707
• Binomial coefficient C(7n,n-4).at n=3A004372
• Expansion of eta(q^10)^12/(eta(q^2)^4*eta(q^5)^8) in powers of q.at n=20A006710
• a(n) = binomial coefficient C(n,46).at n=3A010999
• Even tetrahedral numbers.at n=35A015220
• Binomial coefficients C(49,n).at n=3A017765
• (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=24A030002
• a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=24A030003
• a(n) = T(8,n), array T given by A048483.at n=11A048491
• Generalized Stirling number triangle of first kind.at n=31A049444
• (Prime(n)# - 4)/2 is prime, where x# is the primorial A034386(x).at n=31A067026
• a(n) = lcm(n, n+1, n+2)/6.at n=46A067046
• Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=24A071863
• Triangle read by rows: T(n,k) = binomial(n^2, k), 0 <= k <= n.at n=31A090642
• Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 3, n-k) for n>=k>=0.at n=24A126457
• A 10th-order Fibonacci sequence.at n=21A127194
• Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the first kind (n >= 2; 1 <= k <= n-1; s(n,j) = A008275(n,j)).at n=31A136124
• Unsigned 2-Stirling numbers of the first kind.at n=31A143491
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph is either a tree or a cycle.at n=34A144163