46872

Appears in sequences

• Expansion of e.g.f.: cosh(sin(x)*exp(x)).at n=9A009147
• Differences between two positive cubes in exactly 2 ways.at n=26A014440
• Least sum of 4 positive cubes in exactly n ways.at n=10A025420
• Positive numbers k such that (k+1)*(k+2)*(k+3)*(k+4)/(k+(k+1)+(k+2)+(k+3)+(k+4)) is an integer.at n=35A032795
• Difference between two positive cubes in more than one way.at n=28A034179
• Sums of 2 distinct powers of 6.at n=18A038478
• Sum of two (possibly negative) cubes in at least 3 ways.at n=10A051383
• a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=30A051744
• Sums of two powers of 6.at n=24A055257
• Least number which is the sum of four nonnegative cubes (not necessarily distinct and including zero) in n ways.at n=11A076749
• Numbers that have exactly eight prime factors counted with multiplicity (A046310) whose digit reversal is different and also has 8 prime factors (with multiplicity).at n=4A109028
• Triangle generated by e.g.f.: A(x,y) = exp(x + y*(x^2+x^3)), read by rows of length [n/2+1].at n=27A118588
• A001263 * A128064 (unsigned).at n=50A136534
• Numbers divisible by at least five of their digits, different and >1.at n=6A187533
• Oblong numbers that are the product of two oblong numbers.at n=16A188660
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=24A190108
• Number of lower triangles of an n X n 0..6 array with each element unequal to the sum mod 7 of its horizontal and vertical neighbors.at n=2A194503
• T(n,k)=Number of lower triangles of an n X n 0..k array with each element unequal to the sum mod k+1 of its horizontal and vertical neighbors.at n=30A194505
• Number of arrays of 4 integers in -n..n with sum zero and adjacent elements differing in absolute value.at n=20A202964
• Expansion of f(x)^12 in powers of x where f() is a Ramanujan theta function.at n=35A209676