96852

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=32A001210
• a(n) = a(n-1) + a(n-1-(number of odd terms so far)).at n=46A007604
• Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers.at n=5A067093
• Coefficients of tribonacci numbers expansion : similar to the Fibonacci number expansion given in Steve Roman's Umbral Calculus.at n=30A137431
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second and third differences.at n=25A200205
• Numbers k such that Bernoulli number B_{k} has denominator 3404310.at n=15A295596