68590

Appears in sequences

• Number of 3-voter voting schemes with n linearly ranked choices.at n=36A007009
• Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=17A019579
• a(n) = n*(n - 1)^3/2.at n=20A019582
• A073214/2.at n=13A073222
• Square array read by antidiagonals. Convolution of a(n) = 2*a(n-1) - a(n-2) and 10^n.at n=31A178643
• a(n) = 10*n^3.at n=19A244729
• Numbers whose squares became cubes if some digit is prepended, inserted or appended.at n=31A248127
• Integers that are Rhonda numbers to base 30.at n=30A255736
• Number of compositions of n where each part after the first is either twice, half, or equal to the prior part.at n=23A342340
• Consecutive states of the linear congruential pseudo-random number generator (7200*s + 1) mod 23^4 when started at s=1.at n=3A383162