132085
domain: N
Appears in sequences
- Number k such that k^2 + 1 = p*q*r where p,q,r are distinct primes and the sum p+q+r is a perfect square.at n=28A261529
- Number of (n+3)X(4+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=4A262336
- Number of (n+3)X(5+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=3A262337
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=31A262338
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=32A262338