23887872

Appears in sequences

• a(n) = (11*n + 2)^3.at n=26A017415
• a(n) = (12*n)^3.at n=24A017523
• Cubes such that digits of cube root of n appear in both n^(2/3) and n.at n=25A029782
• For the numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.at n=20A057445
• Card-matching numbers (Dinner-Diner matching numbers).at n=22A059061
• Card-matching numbers (Dinner-Diner matching numbers).at n=29A059067
• a(n) = Product_{k=0...n} (k!^3).at n=4A061719
• a(n) is the greatest common divisor of (n-1)! and n^n.at n=17A062763
• Numbers n such that A017666(n)=phi(n).at n=30A069058
• Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.at n=31A069154
• Expansion of x*(1+3*x+12*x^2)/(1-24*x^3).at n=16A076506
• Expansion of 3*x*(1-x)*(1+2*x+6*x^2)/(1-24*x^3).at n=16A076509
• Expansion of 3*(1+2*x+6 x^2)/(1-24*x^3).at n=15A076510
• Array T(i,1)=i, T(1,j)=j and T(i,j)=T(i-1,j-1)*T(i,j-1) read by antidiagonals.at n=39A085916
• Largest 3-smooth number dividing n!.at n=15A118381
• Largest 3-smooth number dividing n!.at n=16A118381
• a(n) = 3 * 2^(n-1) * a(n-1) with a(0) = 1.at n=6A132727
• Triangle read by rows: T(n,m) = (m+1)^n*m^(n*(n-1)/2).at n=23A132945
• a(n) = Product_{k=1..d(n)-1} lcm(b(k), b(k+1)), where b(k) is the k-th positive divisor of n and d(n) = the number of positive divisors of n.at n=23A136182
• a(n) = 12*a(n-2) for n > 2; a(1) = 1, a(2) = 8.at n=13A162466