39433
domain: N
Appears in sequences
- Convolution of natural numbers >= 2 and the partition numbers (A000041).at n=24A082775
- Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).at n=49A092337
- Number of unattainables <= 10^n, where unattainables are A063425.at n=4A096355
- Consider the array T(n, m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the row sum of A to the first coefficient of one.at n=29A112285
- a(n)*a(n-13) = a(n-1)*a(n-12)+a(n-6)+a(n-7) with initial terms a(1)=...=a(13)=1.at n=37A133854
- 11-gonal numbers which are products of two distinct primes.at n=13A354448