20623

Appears in sequences

• a(n) = number of primes p, p <= 2^n, where 2^n + p is composite.at n=18A175148
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor, with no 2-loops and with no occupancy greater than 2.at n=37A217227
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor, with no 2-loops and with no occupancy greater than 2.at n=43A217227
• Number of n X 2 arrays of occupancy after each element moves to some horizontal or vertical neighbor but without 2-loops.at n=7A217340
• T(n,k) = Number of n X k arrays of occupancy after each element moves to some horizontal or vertical neighbor but without 2-loops.at n=37A217346
• T(n,k) = Number of n X k arrays of occupancy after each element moves to some horizontal or vertical neighbor but without 2-loops.at n=43A217346
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without 2-loops.at n=46A221114
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=46A221388
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=43A221400
• Number of partitions p of n such that max(p) - min(p) is not a part of p.at n=37A238494
• Numbers n such that prime(n) contains a substring of all the prime digits in order, i.e., "2357".at n=6A295708
• Number of non-knapsack integer partitions of n.at n=37A366754