24343
domain: N
Appears in sequences
- G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=33A003403
- Number of partitions of n that do not contain 8 as a part.at n=39A027342
- Numerators of continued fraction convergents to sqrt(974).at n=7A042884
- Expansion of Product_{m>=1} (1+x^m)^A000009(m).at n=24A050342
- a(n) = floor(n^log(n)).at n=23A061567
- Expansion of 1/(exp(-x) - x) as exponential generating function.at n=6A072597
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=33A241049
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=19A252525
- 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=16A341093
- a(n) = Sum_{k=1..n} (-1)^(k+1) * floor((n/k)^3).at n=29A350222