20199
domain: N
Appears in sequences
- Numbers that are the sum of 9 nonzero 8th powers.at n=29A003387
- Numbers that are the sum of 6 positive 9th powers.at n=8A003395
- Numbers that are the sum of at most 6 positive 9th powers.at n=38A004890
- Total sum of 9th powers of parts in all partitions of n.at n=3A229331
- Total sum of n-th powers of parts in all partitions of 3.at n=9A229354
- a(n) = a(n-7) + a(n-4) + a(n-1) for n>1 and a(n)=1 for n<=1.at n=26A262602
- 8-digit numbers (padded with leading zeros where necessary) in which the sum of the number consisting of the first four digits and the number consisting of the last four digits equals the number consisting of the middle four digits.at n=3A293686
- Number of inversion sequences of length n avoiding the consecutive pattern 010.at n=8A328504
- Expansion of Product_{i>=1, j>=1} 1/(1 - i*x^(i*j)).at n=14A332199
- A sequence of integers from an additive problem with prime numbers.at n=24A348472
- Triangular array T(n,k) read by rows, satisfies A377441(n, k+2) = Sum_{m=0..k} T(k, m)*n^m.at n=38A377443
- Expansion of (1/x) * Series_Reversion( x * (1-x)^3 / C(x) ), where C(x) is the g.f. of A000108.at n=5A381880