login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A134515
Third column (k=2) of triangle A134832 (circular succession numbers).
2
1, 0, 0, 10, 15, 168, 1008, 8244, 73125, 726440, 7939008, 94744494, 1225760627, 17088219120, 255365758560, 4072255216296, 69021889788969, 1239055874931312, 23484788783212480, 468656477004105810, 9821896865573503095
OFFSET
0,4
COMMENTS
a(n) enumerates circular permutations of {1,2,...,n+2} with exactly two successor pairs (i,i+1). Due to cyclicity also (n+2,1) is a successor pair.
REFERENCES
Ch. A. Charalambides, Enumerative Combinatorics, Chapman & Hall/CRC, Boca Raton, Florida, 2002, p. 183, eq. (5.15), for k=2.
LINKS
Bhadrachalam Chitturi and Krishnaveni K S, Adjacencies in Permutations, arXiv preprint arXiv:1601.04469 [cs.DM], 2016.
FORMULA
E.g.f.: (d^2/dx^2) (x^2/2!)*(1-log(1-x))/e^x.
a(n) = (((n+2)*(n+1))/2)*A000757(n), n>=0.
EXAMPLE
a(2)=0 because the 4!/4 = 6 circular permutations of n=4 elements (1,2,3,4), (1,4,3,2), (1,3,4,2),(1,2,4,3), (1,4,2,3) and (1,3,2,4) have 4,0,1,1,1 and 1 successor pair, respectively.
CROSSREFS
Cf. A135799 (column k=1).
Sequence in context: A238759 A278349 A114703 * A232608 A175335 A167788
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Jan 21 2008, Feb 22 2008
STATUS
approved