104883
domain: N
Appears in sequences
- a(n) = a(n-1) + Sum_{0<k<=n/5} a(n-5k) with a(0)=1.at n=40A113444
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p.at n=47A241829
- Triangle defined by T(n,k) = Sum_{j>=0} C(j+k, k) * C((j+k)*k, n-k) / 2^(j+k+1), for n>=0, k = 0..n, as read by rows.at n=39A300280
- Numbers k such that k^8*2^k - 1 is a prime.at n=22A367572