139440
domain: N
Appears in sequences
- Triangle of coefficients of Gandhi polynomials.at n=25A036970
- a(n) = least k such that the average number of divisors of {1..k} is >= n.at n=11A085829
- Another version of triangular array in A036970: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] where DELTA is the operator defined in A084938.at n=33A094346
- E.g.f. equals the imaginary part of the i-th iteration of (x + x^2), where i=sqrt(-1).at n=7A179201
- Number of permutations of order n such that no proper partial sum is zero modulo n.at n=8A232663
- Triangular array read by rows. T(n,k) is the number of partial functions on [n] with index k, n=0 implies k=1, otherwise n >= 1, 1 <= k <= n.at n=26A341093
- Triangle read by rows: the coefficients of polynomials (1/3^(m-n)) * Sum_{k=0..m} k^n * 2^(m-k) * binomial(m,k) in the variable m.at n=61A383140