19431

Appears in sequences

• T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=42A050161
• T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.at n=33A050164
• Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=20A096517
• Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=37A111036
• Numbers of the form 110 + p^2. (where p is a prime).at n=33A138693
• Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution x to A328248(x) = n-1.at n=50A328250