60433
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n).at n=62A125753
- Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 1).at n=62A125761
- Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 2n).at n=62A126743
- Squarefree numbers (A005117) with prime factors in a prime(k) + k progression.at n=12A232169
- Squarefree numbers (A005117) of form prime(k)*q where q = primes of the form prime(k) + k.at n=11A232170
- Number of (n+3)X(2+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=11A262451