924000

Appears in sequences

• Numbers n that raised to the powers from 1 to k (with k>=1) are multiples of the sum of their digits (and n raised to k+1 must not be such a multiple). Case k=14.at n=23A135199
• Number of permutations of 1..n with the sequence of sums of 3 adjacent elements having exactly 1 maximum.at n=9A179716
• Triangle S(n,k) by rows: coefficients of 5^((n-1)/2)*(x^(1/5)*d/dx)^n when n is odd, and of 5^(n/2)*(x^(4/5)*d/dx)^n when n is even.at n=31A223171
• Triangle T(n,k) represents the coefficients of (x^11*d/dx)^n, where n=1,2,3,...at n=24A223513
• Triangle S(n,k) by rows: coefficients of 5^(n/2)*(x^(4/5)*d/dx)^n when n=0,2,4,6,...at n=17A223530
• Number of length-5 0..n arrays with no following elements greater than or equal to the first repeated value.at n=14A267234