21963

Appears in sequences

• T(n,n+1), array T as in A047060.at n=9A047066
• Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n.at n=20A110375
• Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1000-1000-1100-0111 pattern in any orientation.at n=15A147103
• a(n) = 76*n^2 - 1.at n=16A158765
• A213784/12.at n=35A213789
• Number of nX6 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=2A283632
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=30A283634
• Number of 3Xn 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=5A283636
• a(n) = Sum_{j=1..n} A003718(j-1)*prime(j).at n=32A342604
• a(n) = Sum_{d|n} (n-d)^tau(d).at n=17A345273
• a(n) is the number of subsets of the divisors of k which sum to k+1 where k is a number all of whose prime divisors are consecutive primes starting at 2.at n=35A359753
• Numbers k such that 5^k - 22 is prime.at n=9A378868