login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176736 a(n) = (n+9)*a(n-1) + (n-1)*a(n-2), a(-1)=0, a(0)=1. 3
1, 10, 111, 1352, 17909, 256134, 3931555, 64441684, 1123029513, 20730064706, 403978495031, 8286870547680, 178468044946621, 4025739435397822, 94912091598455979, 2334250550458513004, 59779945135439664785, 1591626582328767492474, 43990176790179196598143, 1260374228606935319612536 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) enumerates the possibilities for distributing n beads, n>=1, labeled differently from 1 to n, over a set of (unordered) necklaces, excluding necklaces with exactly one bead, and k=10 indistinguishable, ordered, fixed cords, each allowed to have any number of beads. Beadless necklaces as well as beadless cords contribute a factor 1 in the counting, e.g., a(0):= 1*1 =1. See A000255 for the description of a fixed cord with beads. This produces for a(n) the exponential (aka binomial) convolution of the subfactorial sequence {A000166(n)} and the sequence {A049398(n) = (n+9)!/9!}. See the necklaces and cords problem comment in A000153. Therefore the recurrence with inputs holds. This comment derives from a family of recurrences found by Malin Sjodahl for a combinatorial problem for certain quark and gluon diagrams (Feb 27 2010).

LINKS

Table of n, a(n) for n=0..19.

FORMULA

E.g.f. (exp(-x)/(1-x))*(1/(1-x)^10) = exp(-x)/(1-x)^11, equivalent to the given recurrence.

a(n) = A086764(n+10,10).

EXAMPLE

Necklaces and 10 cords problem. For n=4 one considers the following weak 2-part compositions of 4: (4,0), (3,1), (2,2), and (0,4), where (1,3) does not appear because there are no necklaces with 1 bead. These compositions contribute respectively !4*1,binomial(4,3)*!3*c10(1), (binomial(4,2)*! 2)*c10(2), and 1*c10(4) with the subfactorials !n:=A000166(n) (see the necklace comment there) and the c10(n):=A049398(n) numbers for the pure 10-cord problem (see the remark on the e.g.f. for the k-cord problem in A000153; here for k=10: 1/(1-x)^10). This adds up as 9 + 4*2*10 + (6*1)*110 + 17160 = 17909 = a(4).

CROSSREFS

Cf. A176735 (necklaces and k=9 cords).

Sequence in context: A014993 A015592 A122574 * A084031 A210507 A066275

Adjacent sequences:  A176733 A176734 A176735 * A176737 A176738 A176739

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang, Jul 14 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 25 22:13 EST 2018. Contains 299661 sequences. (Running on oeis4.)