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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052849 a(0) = 0; a(n+1) = 2*n! (n >= 0). 33
0, 2, 4, 12, 48, 240, 1440, 10080, 80640, 725760, 7257600, 79833600, 958003200, 12454041600, 174356582400, 2615348736000, 41845579776000, 711374856192000, 12804747411456000, 243290200817664000, 4865804016353280000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

For n >= 1 a(n) is the size of the centralizer of a transposition in the symmetric group S_(n+1). - Ahmed Fares (ahmedfares(AT)my-deja.com), May 12 2001

For n > 0, a(n) = n! - A062119(n-1) = number of permutations of length n that have two specified elements adjacent. For example, a(4) = 12 as of the 24 permutations, 12 have say 1 and 2 adjacent: 1234, 2134, 1243, 2143, 3124, 3214, 4123, 4213, 3412, 3421, 4312, 4321. - Jon Perry, Jun 08 2003

With different offset, denominators of certain sums computed by Ramanujan.

From Michael Somos, Mar 04 2004: (Start)

Stirling transform of a(n) = [2, 4, 12, 48, 240, ...] is A000629(n) = [2, 6, 26, 150, 1082, ...].

Stirling transform of a(n-1) = [1, 2, 4, 12, 48, ...] is A007047(n-1) = [1, 3, 11, 51, 299, ...].

Stirling transform of a(n) = [1, 4, 12, 48, 240, ...] is A002050(n) = [1, 5, 25, 149, 1081, ...].

Stirling transform of 2*A006252(n) = [2, 2, 4, 8, 28, ...] is a(n) = [2, 4, 12, 48, 240, ...].

Stirling transform of a(n+1) = [4, 12, 48, 240, ...] is 2*A005649(n) = [4, 16, 88, 616, ...].

Stirling transform of a(n+1) = [4, 12, 48, 240, ...] is 4*A083410(n) = [4, 16, 88, 616, ...]. (End)

Number of {12, 12*, 21, 21*}-avoiding signed permutations in the hyperoctahedral group.

Permanent of the (0, 1)-matrices with (i, j)-th entry equal to 0 if and only if it is in the border but not the corners. The border of a matrix is defined the be the first and the last row, together with the first and the last column. The corners of a matrix are the entries (i = 1, j = 1), (i = 1, j = n), (i = n, j = 1) and (i = n, j = n). - Simone Severini, Oct 17 2004

a(n) = A245334(n, n-1), n > 0. - Reinhard Zumkeller, Aug 31 2014

REFERENCES

B. C. Berndt, Ramanujan's Notebooks Part V, Springer-Verlag, see p. 520.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..400

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 817

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 490

T. Mansour and J. West, Avoiding 2-letter signed patterns, arXiv:math/0207204 [math.CO], 2002.

Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.

Index entries for sequences related to factorial base representation

FORMULA

Recurrence: {a(0) = 0, a(1) = 2, (-1 - n)*a(n+1) + a(n+2)}.

E.g.f.: 2*x/(1-x).

a(n) = A090802(n, n - 1) for n > 0. - Ross La Haye, Sep 26 2005

For n >= 1, a(n) = (n+3)!*Sum_((-1)^k*binomial(2, k)/(n + 3 - k), k = 0..n + 2). - Milan Janjic, Dec 14 2008

G.f.: 2/Q(0) - 2, where Q(k) = 1 - x*(k + 1)/(1 - x*(k + 1)/Q(k+1) ); (continued fraction ). - Sergei N. Gladkovskii, Apr 01 2013

G.f.: -2 + 2/Q(0), where Q(k) = 1 + k*x - x*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 01 2013

G.f.: W(0) - 2 , where W(k) = 1 + 1/( 1 - x*(k+1)/( x*(k+1) + 1/W(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 21 2013

MAPLE

spec := [S, {B=Cycle(Z), C=Cycle(Z), S=Union(B, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);

MATHEMATICA

Join[{0}, 2Range[20]!] (* Harvey P. Dale, Jul 13 2013 *)

PROG

(PARI) a(n)=if(n<1, 0, n!*2)

(Haskell)

a052849 n = if n == 0 then 0 else 2 * a000142 n

a052849_list = 0 : fs where fs = 2 : zipWith (*) [2..] fs

-- Reinhard Zumkeller, Aug 31 2014

(MAGMA) [0] cat [2*Factorial(n-1): n in [2..25]]; // Vincenzo Librandi, Nov 03 2014

CROSSREFS

a(n) = T(n, 2) for n>1, where T is defined as in A080046.

Essentially the same sequence as A098558. Cf. A062119.

Cf. A245334, A000142.

Row 3 of A276955 (from term a(2)=4 onward).

Sequence in context: A002871 A013172 A321009 * A098558 A152827 A030813

Adjacent sequences:  A052846 A052847 A052848 * A052850 A052851 A052852

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

EXTENSIONS

More terms from Ross La Haye, Sep 26 2005

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 20:18 EDT 2019. Contains 327181 sequences. (Running on oeis4.)