25661

Appears in sequences

• Least k such that first k terms of A022303 contain n more 2's than 1's.at n=16A025518
• Positive integers of the form (30*m^2+1)/11.at n=17A179339
• Number of permutations of length n sortable by a pop stack followed by a queue and then by a stack.at n=7A214611
• Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0.at n=6A267340
• Number of 7Xn arrays containing n copies of 0..7-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo 7 and the upper left element equal to 0.at n=7A267347
• Square array A(m,n) (m>=1, n>=1) read by antidiagonals: A(m,n) = (2*n - 1)^^m mod (2*n)^m (see Comments for definition of ^^).at n=48A324017
• a(n) is the least number whose product of digits in primorial base equals n.at n=22A355036