38259

Appears in sequences

• a(n) = [ e*a(n-1) ], where a(0) = 1.at n=11A024576
• Numbers that are the sum of 3 positive cubes in exactly 3 ways.at n=21A025397
• Numbers that are the sum of 3 positive cubes in 3 or more ways.at n=22A025398
• Numbers that are the sum of 3 distinct positive cubes in exactly 3 ways.at n=18A025401
• Numbers that are the sum of 3 distinct positive cubes in 3 or more ways.at n=19A025402
• Numbers where the difference of consecutive fifth powers is "close" to another fifth power: let m = k^5 - (k-1)^5; sequence lists the numbers k where m - floor(m^(1/5))^5 < floor(sqrt(k))^5.at n=7A053804
• Numbers that can be expressed as the sum of three nonnegative cubes in three ways.at n=26A219329
• Expansion of Product_{k>=1} (1 + x^(2*k-1))^(2*k-1).at n=31A262736
• Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.at n=12A269620
• a(n) = n*(n + 1)*(4*n + 5)/2.at n=26A281381
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly 2 ways.at n=19A377729