31108

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=24A001210
• a(n) = (n+1)*(n+2)/2 * Sum_{k=0..floor(n/2)} n!/(n-2*k)!.at n=6A114633
• Number of permutations of 1..n with both permutation and its inverse having exactly 2 maxima.at n=11A180392
• Triangle read by rows: T(n, k) is the number of squarefree integers x such that x<=primorial(n) and omega(n) = k with 0<=k<=n.at n=42A261215
• Numbers k that divide Sum_{i=1..k} (i - d(i)), where d(n) is the number of divisors of n (A000005).at n=15A362864