35696

Appears in sequences

• Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.at n=11A000085
• Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals.at n=67A008307
• Sum of squares of first n positive integers congruent to 1 mod 3.at n=22A024215
• Bisection of A000085.at n=5A066224
• Triangle read by rows where T(n+1,k)=T(n,k)+n*T(n-1,k) starting with T(n,n)=1 and T(n,k)=0 if n<k.at n=66A070895
• Number of 11 X 11 arrays of squares of integers, symmetric about main diagonal, with all rows summing to n.at n=1A156405
• T(n,k)=Number of (n*k)Xk binary arrays with nonzero rows in decreasing order, no more than 2 ones in any row and exactly n ones in every column.at n=55A188448
• Number of standard Young tableaux of n cells and height <= 11.at n=11A229053
• Number of standard Young tableaux of n cells and height <= 12.at n=11A229068
• Number of (n+1)X(7+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=2A231395
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=38A231396
• Number of (3+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=6A231399
• Number of self-inverse permutations p on [n] with displacement of elements restricted by 10: |p(i)-i| <= 10.at n=11A239082
• Number of Sidon subsets of {1,...,n} of size 4.at n=33A241688
• Expansion of (1-2*x^2) / ( 1-2*x-4*x^2+6*x^3 ).at n=11A271895
• Number T(n,k) of multisets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=67A293808
• Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows.at n=39A293815
• Number T(n,k) of partitions of [n] having exactly k blocks of size at least three; triangle T(n,k), n>=0, 0<=k<=floor(n/3), read by rows.at n=26A355144
• Triangular array read by rows: T(m,n) = number of Yamanouchi words of length m that start with n, m >= 1, n = 1..m.at n=66A369588
• Number of involutions in the symmetric group S_n with at least one fixed point.at n=11A378100