45506
domain: N
Appears in sequences
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=36A064112
- Total number of parts in all partitions of n plus the sum of largest parts in all partitions of n plus the number of partitions of n plus n.at n=26A225610
- Least integer k such that prime(k+1) - prime(k) = 2 and prime(k+2) - prime(k+1) = 2n, or 0 if no such k exists.at n=32A280941
- Concatenation of sum n+(n+1) and product n*(n+1) in decimal.at n=22A337148