494208

Appears in sequences

• Kaprekar triples: q such that q = x + y + z and q^3 = x*10^2n + y*10^n + z, where z < 10^n and n is the number of digits in q. q is not a power of 10 (except q=1).at n=34A006887
• Erroneous version of A006887.at n=35A060809
• Factorial splitting: write n! = x*y*z with x<y<z and x maximal; sequence gives value of x.at n=16A061030
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=10A150402
• a(n) = (n-1)*(n+2)*(n^2 + n + 2)/4.at n=36A168566
• a(n) = 6*(n+1)!/((3+floor(n/2))*(floor(n/2)!)^2).at n=15A242986
• Number of length 1+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=25A247727
• Numbers of the form N = a+b+c such that N^3 = concat(a,b,c); a, b, c > 0.at n=19A328198
• Factorial splitting: write n! = x*y*z with x <= y <= z and minimal z-x; sequence gives value of x.at n=19A355189