ECS #207: Denumerant
Welcome! Research Topics People Publications Seminars Software On-Line Applications Jobs & Internships

ALGO logo ECS #207: Denumerant

Introduction Examples Search Submit Help Links

1. Description

number of ways to make n cents with coins of 1 1 3 cents

2. Specification

This unlabelled structure is specified as S in

\displaystyle \left\{ S={\rm Prod} \left( {\rm Sequence} \left( Z \right) ,{\rm Sequence} \left( Z \right) ,{\rm Sequence} \left( {\rm Prod} \left( Z,Z ,Z \right) \right) \right) \right\}
other formats

3. Coefficients

3.1. First terms

3.2. Recurrence

\displaystyle \left\{ -2\,f \left( n \right) -2\,f \left( n+1 \right) -2\,f \left( n +2 \right) +{n}^{2}+7\,n+12=0,f \left( 0 \right) =1,f \left( 1 \right) =2 \right\}
other formats

3.3. Closed form

\displaystyle {\frac {8}{9}}+1/6\,{n}^{2}+5/6\,n+\sum _{\alpha={\rm RootOf} \left( {{ \rm \_Z}}^{2}+{\rm \_Z}+1 \right) }-1/9\,{\alpha}^{-n-1}
other formats

3.4. Asymptotics

4. Ordinary generating function

\displaystyle -{\frac {1}{ \left( -1+x \right) ^{2} \left( -1+{x}^{3} \right) }}
other formats

5. References

EIS A001840

6. Random structure


Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).

Generated: 2010-02-09 20:51:49 in 2. seconds of elapsed time.
Based on commit 9d1e479..., Fri Jul 10 14:52:30 2009 +0200.
Powered by DynaMoW.