184757
domain: N
Appears in sequences
- a(n) = binomial(n, floor(n/2)) + 1.at n=20A051920
- a(n) = Sum_{d|n} binomial(2*d-2,d-1).at n=10A066768
- a(n) = n^4 - n^3 - n^2 - n - 1.at n=21A125082
- Number of compositions of n with exactly ten occurrences of the largest part.at n=20A243745
- Number of compositions of n in which the minimal multiplicity of parts equals 10.at n=20A244173
- Number of compositions of 3n in which the minimal multiplicity of parts equals n.at n=10A244174
- Number of preferential arrangements of n labeled elements when at least k=9 elements per rank are required.at n=19A245794
- Number of preferential arrangements of n labeled elements when at least k=10 elements per rank are required.at n=20A245795
- a(n) = binomial(2*(n - 1), n - 1) + 1.at n=11A323230
- First term of n-th difference sequence of (floor(r*k)), r = log(3), k >= 0.at n=20A325752
- a(n) = Sum_{d|n} binomial(n+d-2, n-1).at n=10A332508
- a(n) = Sum_{d|n} (n/d)^(d-1) * binomial(d+n-2,n-1).at n=10A363666
- a(n) = Sum_{d|n} (n/d)^(n-n/d) * binomial(d+n-2,n-1).at n=10A363667
- a(n) is the smallest base b such that (b+1)^n in base b is a palindrome.at n=19A367857