28764

Appears in sequences

• Coefficients of ménage hit polynomials.at n=5A000450
• a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2n) = 6. Also a(n) = T(2n,n-2), where T is the array defined in A026009.at n=7A026014
• Numbers whose base-13 representation has exactly 5 runs.at n=19A043660
• T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=39A050162
• a(n) = n*(n+1)*(n+2)*(n+3)*(3*n+2)/120.at n=15A051836
• Triangle giving coefficients of ménage hit polynomials.at n=50A058057
• Numbers k such that the digits of sigma(k) are a permutation of those of k, in base 10.at n=29A115920
• Number of ways of placing kings with no more than 2 mutual attacks on an n X n chessboard symmetric under 180 degree rotation.at n=7A143880
• Number of ways of placing kings with no more than 3 mutual attacks on an n X n chessboard symmetric under 180 degree rotation.at n=7A143885
• A ménage triangle.at n=49A156368
• Numbers k such that 6*prime(k) -+ {1,5} are all prime.at n=38A174393
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 4,0,0,1,2,0,0 for x=0,1,2,3,4,5,6.at n=5A202761
• Number of compositions of n avoiding the pattern 1111.at n=18A232464
• Sum of the third largest parts of the partitions of 4n into 4 parts.at n=17A242727
• Least positive integer k such that prime(k*n) has the form p^2 - 2 with p prime, or 0 if no such k exists.at n=30A253257
• Triangle read by rows: coefficients of polynomials P_n(x) arising from RNA combinatorics.at n=12A270791
• Sum over all partitions of n of the bitwise XOR of the parts.at n=28A306903
• First term of n-th difference sequence of (floor(k*r)), r = sqrt(1/2), k >= 0.at n=17A325729
• The number of free polyominoes of width 2 and height n.at n=11A335711
• Even numbers 2m such that A352612(2m) = A103131(2m).at n=35A352587