113792
domain: N
Appears in sequences
- Total sum of odd parts in all partitions of n.at n=30A066967
- E.g.f. satisfies A(x)^A(x) = 1/(1 - x*A(x)).at n=7A141209
- G.f. satisfies A(x) = 1 + x*(A(x)^2 + A(x)^4).at n=6A219534
- Expansion of e.g.f. Product_{k>=1} (1 + log(1/(1 - x))^k)/(1 - log(1/(1 - x))^k).at n=6A307524
- a(0) = A002858(1) = 1, followed by the greatest Ulam numbers A002858 to form a complete sequence (see algorithm below).at n=17A348413
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(2*n+2*r+k,n)/(2*n+2*r+k) for k > 0.at n=34A378239
- Brent's irregular triangle T[r,k] related to Hardy-Littlewood constants of prime gaps 2r.at n=68A381083
- Column k=2 of Brent's table A381083 related to prime gaps 2n.at n=15A381085