24696

Appears in sequences

• a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^3.at n=29A008457
• Product of digits of 2^n.at n=24A014257
• Gaps of 8 in sequence A038593 (lower terms).at n=17A038655
• a(n) = Product_{i=1..n} ((i+4)*(i+5)*(i+6)*(i+7))/(i*(i+1)*(i+2)*(i+3)).at n=3A047835
• Expansion of e.g.f.: (1-x)^(-1/2)*exp(-x/2 -x^2/4 -x^3/6).at n=9A053532
• Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.at n=40A056939
• Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.at n=31A056940
• Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.at n=32A056940
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,37.at n=4A064255
• Number of ways to tile hexagon of edges n, n+1, n+1, n, n+1, n+1 with diamonds of side 1.at n=3A071095
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=13A074310
• a(n) = Sum_{d divides n} (-1)^(n/d+1)*d^3.at n=29A078307
• Convolution of primes with partition numbers.at n=19A086717
• Square array T(n,k) read by antidiagonals: number of tilings of an <n,k,n> hexagon.at n=24A103905
• a(n) = binomial(n+4,4)*binomial(n+5,4)*binomial(n+6,4)/75.at n=4A107915
• Numbers with at least two 3s in their prime signature.at n=59A109399
• n*phi(n)*phi(phi(n)) is a square.at n=37A116002
• Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=49A116071
• Triangle of Hankel transforms of binomial(n+k, k).at n=31A120247
• Triangle of Hankel transforms of certain binomial sums.at n=24A120257