95575

Appears in sequences

• Number of permutations of length n by rises.at n=3A001280
• Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= floor(n/2)) = number of permutations of 1..n with exactly floor(n/2) - k runs of consecutive pairs up.at n=36A010029
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)).at n=40A136123
• Number of sequences of length n with elements {-2,-1,+1,+2}, counted up to simultaneous reversal and negation, such that the sum of elements of the whole sequence but of no proper subsequence equals 0 modulo n. For n>=4, the number of Hamiltonian (undirected) cycles on the circulant graph C_n(1,2).at n=29A137726
• Expansion of (3-2*x)/(1-x-x^3)+x/(1-x)^2+x/(1-x^2).at n=30A226509
• Number of (undirected) Hamiltonian cycles in the n-antiprism graph.at n=14A306447