36806
domain: N
Appears in sequences
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=40A001209
- Number of (weakly) unimodal compositions of n where all parts 1, 2, ..., m appear where m is the largest part.at n=31A227038
- The continued fraction of the positive constant r < sqrt(3) such that the partial quotients equal the integer floor of the powers of r.at n=20A227232
- Numbers n for which the alternating sum of the digits of n^n is 0.at n=38A244212
- Binomial(n,4) - A290447(n).at n=46A290461
- a(n) = A006561(n) - A290447(n).at n=46A290465
- a(n) = Sum_{k=0..floor(n/5)} (n-4*k)!/(n-5*k)!.at n=29A357570