20932

Appears in sequences

• T(n,n), array T given by A047010.at n=9A047012
• Numbers k such that 10^k + 3*R_k + 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A102932
• a(n) = Sum_{k=0..n} binomial(n,2k)*A002426(k).at n=12A162533
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k strong fixed blocks (see first comment for definition).at n=41A186373
• Expansion of 1/(1 - x^3 - x^4 - x^5 + x^8).at n=45A225482
• Number of permutations of [n] having exactly 3 strong fixed blocks.at n=5A225964
• Number of (n+1)X(6+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=9A253696
• Number of n X n 0..1 arrays with every element unequal to 0, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=5A304670
• Number of nX6 0..1 arrays with every element unequal to 0, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=5A304674
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=60A304676
• a(0) = 1; thereafter a(n) = 10*n^2 - 5*n + 2.at n=46A383466