43120

Appears in sequences

• Number of factorization patterns of polynomials of degree n over integers.at n=23A006171
• a(n) = (2*n - 1)*n^2.at n=28A015237
• a(n) = n^2*(n+1)^2*(4*n^2 - 5*n + 4)/12.at n=7A101381
• a(n) = (n-1)*(n+2)*(2*n+11)/2.at n=32A130862
• a(n) = A139480(n)/2.at n=26A139481
• Integer averages of the first perfect cubes up to some n^3.at n=40A164577
• Triangle T(n, k) = [x^k]( p(n,x) ), where p(n, x) = Sum_{k=1..n} A001263(n,k)*binomial(x+k -1, n-1), read by rows.at n=30A168391
• Expansion of (1+12*x-24*x^2+8*x^4)/((1-8*x+4*x^2+4*x^3)*(1+2*x-2*x^2)).at n=5A177371
• Triangle read by rows: T(n,k) = number of n-element unlabeled N-free posets of height k (1 <= k <= n).at n=61A202181
• Numbers whose digits are a permutation of [0,...,n] and which contain the product of any two adjacent digits as a substring.at n=33A203569
• Numbers k such that k+x+y is a perfect cube, where x and y are the two cubes nearest to k.at n=17A238599
• Number of length 1+4 0..n arrays with no consecutive five elements summing to more than 2*n.at n=9A241937
• a(n) = Product_{d|n, d>1} prime(1+(d mod 6)).at n=35A320116
• a(n) is the largest n-digit number using each digit 0 to n-1 once, such that the numbers formed by its last k digits are divisible by k, (k = 1..n).at n=4A334537
• Conductor of elliptic curve y^2 = x^3 + n*x + n.at n=6A387834