19988
domain: N
Appears in sequences
- a(n) = smallest multiple of 4 with sum of digits = n.at n=34A077489
- a(n) = 1 + n*(n+1)*(n^2-n+12)/12.at n=22A136396
- Numbers k such that 2^k + k^2 - 1 is prime.at n=13A215439
- Numbers k such that (10^k + 41)/3 is prime.at n=22A281493
- Array read by antidiagonals: T(m,n) = number of minimal edge covers in the grid graph P_m X P_n.at n=31A288025
- Array read by antidiagonals: T(m,n) = number of minimal edge covers in the grid graph P_m X P_n.at n=32A288025
- Expansion of Product_{r = 1 or not a perfect power} 1/(1 - x^r).at n=44A305630
- Numbers k such that A055228(k)^2 - A055228(k) is a multiple of k, where A055228(k) is ceiling(sqrt(k!)).at n=50A306014
- a(n) = 2*n*(7*n - 3).at n=38A316466