21297

Appears in sequences

• a(n) = 2*n^3 + 1.at n=22A033562
• Enumeration of fractal 321 avoiders.at n=8A082631
• Write the primes in binary; a(n) = total number of 0's in those which have an n-bit expansion.at n=14A086904
• a(n) = 44*n^2 + 1.at n=22A158630
• Number of ways to arrange 2 nonattacking knights on the lower triangle of an n X n board.at n=19A194486
• Number of (n+2) X 6 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=4A202528
• Number of (n+2) X 7 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=3A202529
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=31A202532
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=32A202532
• Product of n-th prime and the sum of the divisors of n.at n=49A272211
• a(n) = 2*a(n-1) + a(n-3), where a(0) = 0, a(1) = 1, a(2) = 4.at n=13A335274