21362

Appears in sequences

• An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=49A007333
• Numerators of continued fraction convergents to sqrt(6).at n=8A041006
• Numerators of continued fraction convergents to sqrt(54).at n=8A041092
• Numerators of continued fraction convergents to sqrt(486).at n=2A041926
• Same rule as Aitken triangle (A011971) except a(0,0)=1, a(1,0)=0.at n=50A046934
• Sequence formed from rows of triangle A046934.at n=40A046935
• Number of ways to place 6 nonattacking queens on a 6 X n board.at n=11A061992
• Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...at n=41A086514
• Largest number x such that the greatest prime factor of x^2+2 is A033203(n), the n-th prime not congruent to 5 or 7 mod 8.at n=3A185397
• Row sums of number triangle A070895.at n=10A187044
• a(0)=0, a(1)=0; for n>1, a(n) = a(n-1) + (n-3)*a(n-2) + 1.at n=12A193361
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 2 X n array.at n=27A219382
• Triangle T(n,k) read by rows: T(n,k) is the number of length-n ascent sequences with exactly k descents.at n=59A238858
• Number of ascent sequences of length n with exactly four descents.at n=2A241874
• Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array).at n=60A269133
• a(n) = n*(2*n^2 + 3), n >= 1; a(0)=1.at n=22A288534
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=6A298190
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=2A298194
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=38A298195
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=42A298195