29708

Appears in sequences

• Number of partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=46A035963
• Number of ways to place 3 nonattacking kings on an n X n board.at n=8A061996
• a(n) is the smallest value of k such that number of non-unitary prime divisors of k-th Catalan number, A000108(k) = C(2*k,k)/(k+1) equals n.at n=29A081395
• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1.at n=30A098487
• Number of nX4 0..3 arrays with no element equal to the sum of elements to its left or the sum of elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=6A240246
• T(n,k)=Number of nXk 0..3 arrays with no element equal to the sum of elements to its left or the sum of the elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=51A240250
• Numbers n such that the Crandall number C = A262961(n) has exactly one prime divisor p >= n/2.at n=18A265079
• Number of regions in a regular drawing of the complete bipartite graph K_{n,n}.at n=20A290131
• Number of partitions of n with rank a multiple of 3.at n=44A328988