A210667 -id:A210667 - cp's OEIS frontend

A010551 Multiply successively by 1,1,2,2,3,3,4,4,..., n >= 1, a(0) = 1.

1, 1, 1, 2, 4, 12, 36, 144, 576, 2880, 14400, 86400, 518400, 3628800, 25401600, 203212800, 1625702400, 14631321600, 131681894400, 1316818944000, 13168189440000, 144850083840000, 1593350922240000, 19120211066880000, 229442532802560000, 2982752926433280000

Offset: 0

Mark R. Diamond

From Emeric Deutsch, Dec 14 2008: (Start)
Number of permutations of {1,2,...,n-1} having a single run of odd entries. Example: a(5)=12 because we have 1324,1342,3124,3142,2134,4132,2314,4312, 2413, 4213, 2431 and 4231.
a(n) = A152666(n-1,1). (End)
a(n+1) gives the permanent of the n X n matrix whose (i,j)-element is i+j-1 modulo 2. - John W. Layman, Jan 03 2011
From Daniel Forgues, May 20 2011: (Start)
a(0) = 1 since it is the empty product.
A010551(n-2), n >= 2, equal to (ceiling((n-2)/2))! * (floor((n-2)/2))!, gives the number of arrangements of n-2 entries from 2 to n-1, starting with an even entry and where the parity of adjacent entries alternates. This is the number of arrangements to investigate for row n of a prime pyramid (A051237). (End)
Partial products of A008619. - Reinhard Zumkeller, Apr 02 2012
Also size of the equivalence class of S_n containing the identity permutation under transformations of positionally adjacent elements of the form abc <--> acb where a < b < c, cf. A210667 (equivalently under such transformations of the form abc <--> bac where a < b < c.) - Tom Roby, May 15 2012
Row sums of A246117. - Peter Bala, Aug 15 2014
a(n) is the number of parity-alternating permutations of size n. A permutation is parity-alternating if it sends even integers to even, and odd to odd. - Per W. Alexandersson, Jun 06 2022
n divides a(n) if and only if n is not prime. Since a(n) = floor(n/2)!*floor((n+1)/2)!, if n is prime then n is not a factor of a(n). All the prime factors of a(n) are in fact less than or equal to (n+1)/2. If n is composite, then it's possible to write it as p*q with p and q less than or equal to n/2. So p and q are factors of a(n). - Davide Oliveri, Apr 01 2023
Number of permutations of {1, 2, ..., n-1} where each entry is not greater than twice the previous entry. - Dewangga Putra Sheradhien, Jul 13 2024

			G.f. = 1 + x + x^2 + 2*x^3 + 4*x^4 + 12*x^5 + 36*x^6 + 144*x^7 + 576*x^8 + ...
For n = 7, a(n) = 1*1*2*2*3*3*4 (7 factors), which is 144. - _Michael B. Porter_, Jul 03 2016

Reinhard Zumkeller, Table of n, a(n) for n = 0..500
Edinah K. Gnang and Isaac Wass, Growing Graceful and Harmonious Trees, arXiv:1808.05551 [math.CO], 2018-2020. See proposition 1.
Frether Getachew Kebede and Fanja Rakotondrajao, Parity alternating permutations starting with an odd integer, arXiv:2101.09125 [math.CO], 2021.
Steven Linton, James Propp, Tom Roby, and Julian West, Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions, Journal of Integer Sequences, Vol. 15 (2012), #12.9.1.

Cf. A008619, A064044, A246117, A130820, A229020.

Column k=2 of A275062.

a010551 n = a010551_list !! n
a010551_list = scanl (*) 1 a008619_list
-- Reinhard Zumkeller, Apr 02 2012

[Factorial(n div 2)*Factorial((n+1) div 2): n in [0..25]]; // Vincenzo Librandi Jan 17 2018

A010551 := proc(n)
    option remember;
    if n <= 1 then
        1
    else
        procname(n-1) *trunc( (n+1)/2 );
    fi;
end:

FoldList[ Times, 1, Flatten@ Array[ {#, #} &, 11]] (* Robert G. Wilson v, Jul 14 2010 *)

{a(n)=local(X=x+x*O(x^n)); 1/polcoeff(besseli(0,2*X)+X*besseli(1,2*X),n,x)} \\ Paul D. Hanna, Apr 07 2005

A010551(n)=(n\2)!*((n+1)\2)! \\ Michael Somos, Dec 29 2012, edited by M. F. Hasler, Nov 26 2017

def O(f):
    c = 1
    while len(f) > 1:
        f.sort()
        m = abs(f[0] - f[1])
        c *= m
        f[0] = m
        f.pop(1)
    return c
a = lambda n: O(list(range(1, n+1)))
print([a(n) for n in range(0, 26)]) # Darío Clavijo, Aug 24 2024

a(n) = floor(n/2)!*floor((n+1)/2)! is the number of permutations p of {1, 2, 3, ..., n} such that for every i, i and p(i) have the same parity, i.e., p(i) - i is even. - Avi Peretz (njk(AT)netvision.net.il), Feb 22 2001
a(n) = n!/binomial(n, floor(n/2)). - Paul Barry, Sep 12 2004
G.f.: Sum_{n>=0} x^n/a(n) = besseli(0, 2*x) + x*besseli(1, 2*x). - Paul D. Hanna, Apr 07 2005
E.g.f.: 1/(1-x/2) + (1/2)/(1-x/2)*arccos(1-x^2/2)/sqrt(1-x^2/4). - Paul D. Hanna, Aug 28 2005
G.f.: G(0) where G(k) = 1 + (k+1)*x/(1 - x*(k+1)/(x*(k+1) + 1/G(k+1) )); (continued fraction, 3-step). - Sergei N. Gladkovskii, Nov 28 2012
D-finite with recurrence: 4*a(n) - 2*a(n-1) - n*(n-1)*a(n-2) = 0. - R. J. Mathar, Dec 03 2012
a(n) = a(n-1) * (a(n-2) + a(n-3)) / a(n-3) for all n >= 3. - Michael Somos, Dec 29 2012
G.f.: 1 + x + x^2*(1 + x*(G(0) - 1)/(x-1)) where G(k) = 1 - (k+2)/(1-x/(x - 1/(1 - (k+2)/(1-x/(x - 1/G(k+1) ))))); (continued fraction). - Sergei N. Gladkovskii, Jan 15 2013
G.f.: 1 + x*(G(0) - 1)/(x-1) where G(k) = 1 - (k+1)/(1-x/(x - 1/(1 - (k+1)/(1-x/(x - 1/G(k+1) ))))); (continued fraction). - Sergei N. Gladkovskii, Jan 15 2013
G.f.: 1 + x*G(0), where G(k) = 1 + x*(k+1)/(1 - x*(k+2)/(x*(k+2) + 1/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jul 08 2013
G.f.: Q(0), where Q(k) = 1 + x*(k+1)/(1 - x*(k+1)/(x*(k+1) + 1/Q(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 08 2013
Sum_{n >= 1} 1/a(n) = A130820. - Peter Bala, Jul 02 2016
a(n) ~  sqrt(Pi*n) * n! / 2^(n + 1/2). - Vaclav Kotesovec, Oct 02 2018
Sum_{n>=0} (-1)^n/a(n) = A229020. - Amiram Eldar, Apr 12 2021

A212580 Number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> acb where a

Original entry on oeis.org

1, 1, 2, 5, 20, 102, 626, 4458, 36144, 328794, 3316944, 36755520, 443828184, 5800823880, 81591320880, 1228888215960, 19733475278880, 336551479543440, 6075437671458000, 115733952138747600, 2320138519554562560, 48827468196234035280, 1076310620915575933440

Offset: 0

Tom Roby, May 21 2012

nonn

Also the number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> bac where a

Also the number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> cba where a

Also the number of permutations of [n] avoiding consecutive triples j, j+1, j-1. a(4) = 20 = 4! - 4 counts all permutations of [4] except 1342, 2314, 3421, 4231. - Alois P. Heinz, Apr 14 2021

			From _Alois P. Heinz_, May 22 2012: (Start)
a(3) = 5: {123, 132}, {213}, {231}, {312}, {321}.
a(4) = 20: {1234, 1243, 1324}, {1342}, {1423}, {1432}, {2134}, {2143}, {2314}, {2341, 2431}, {2413}, {3124}, {3142}, {3214}, {3241}, {3412}, {3421}, {4123, 4132}, {4213}, {4231}, {4312}, {4321}. (End)

Alois P. Heinz, Table of n, a(n) for n = 0..450
Anders Claesson, From Hertzsprung's problem to pattern-rewriting systems, University of Iceland (2020).
S. Linton, J. Propp, T. Roby, and J. West, Equivalence classes of permutations under various relations generated by constrained transpositions, 2011 arXiv:1111.3920 [math.CO], J. Int. Seq. 15 (2012) #12.9.1

Cf. A174072, A210667, A210668, A210669, A210671, A212417, A212581.

Column k=0 of A343535.

b:= proc(s, x, y) option remember; `if`(s={}, 1, add(
      `if`(x=0 or x-y<>1 or j-x<>1, b(s minus {j}, y, j), 0), j=s))
    end:
a:= n-> b({$1..n}, 0$2):
seq(a(n), n=0..14);  # Alois P. Heinz, Apr 14 2021
# second Maple program:
a:= proc(n) option remember; `if`(n<5, [1$2, 2, 5, 20][n+1],
       n*a(n-1)+3*a(n-2)-(2*n-2)*a(n-3)+(n-2)*a(n-5))
    end:
seq(a(n), n=0..22);  # Alois P. Heinz, Apr 14 2021

a[n_] := a[n] = If[n < 5, {1, 1, 2, 5, 20}[[n+1]],
     n*a[n-1] + 3*a[n-2] - (2n - 2)*a[n-3] + (n-2)*a[n-5]];
Table[a[n], {n, 0, 22}] (* Jean-François Alcover, Apr 20 2022, after Alois P. Heinz *)

my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*(x*(1-x^2))^k)) \\ Seiichi Manyama, Feb 20 2024

From Seiichi Manyama, Feb 20 2024: (Start)
G.f.: Sum_{k>=0} k! * ( x * (1-x^2) )^k.
a(n) = Sum_{k=0..floor(n/3)} (-1)^k * (n-2*k)! * binomial(n-2*k,k). (End)

a(9)-a(22) from Alois P. Heinz, Apr 14 2021

A210668 Number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> cba where a

Original entry on oeis.org

1, 1, 2, 5, 16, 60, 260, 1260, 6744, 39303

Offset: 0

Tom Roby, May 08 2012

nonn

			From _Alois P. Heinz_, May 16 2012: (Start)
a(3) = 5: {123, 321}, {132}, {213}, {231}, {312}.
a(4) = 16: {1234, 1432, 3214}, {1243, 4213}, {1324}, {1342, 4312}, {1423}, {2134, 2431}, {2143}, {2314}, {2341, 4123, 4321}, {2413}, {3124, 3421}, {3142}, {3241}, {3412}, {4132}, {4231}. (End)

Steven Linton, James Propp, Tom Roby, and Julian West, Equivalence classes of permutations under various relations generated by constrained transpositions, 2011 arXiv:1111.3920 [math.CO], J. Int. Seq. 15 (2012) #12.9.1

Cf. A210667, A210669, A210671, A212417.

Definition improved by Tom Roby, May 15 2012

a(0)-a(2), a(9) from Alois P. Heinz, May 16 2012

A210669 Number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> acb <--> cba where a

Original entry on oeis.org

1, 1, 2, 4, 8, 14, 27, 68, 159, 496

Offset: 0

Tom Roby, May 08 2012

nonn

Also number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> bac <--> cba where a

			From _Alois P. Heinz_, May 19 2012: (Start)
a(3) = 4: {123, 132, 321}, {213}, {231}, {312}.
a(4) = 8: {1234, 1243, 1324, 1342, 1423, 1432, 3214, 4213, 4312}, {2134, 2143, 2341, 2431, 4123, 4132, 4321}, {2314}, {2413}, {3124, 3142, 3421}, {3241}, {3412}, {4231}. (End)

Steven Linton, James Propp, Tom Roby, and Julian West, Equivalence classes of permutations under various relations generated by constrained transpositions, 2011 arXiv:1111.3920 [math.CO], J. Int. Seq. 15 (2012) #12.9.1

Cf. A210667, A210668, A210671, A212417, A212418.

Definition improved and comment added by Tom Roby, May 15 2012

A212581 Number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> acb <--> bac where a

Original entry on oeis.org

1, 1, 2, 4, 17, 89, 556, 4011, 32843, 301210, 3059625, 34104275, 413919214, 5434093341, 76734218273, 1159776006262, 18681894258591, 319512224705645, 5782488507020050, 110407313135273127, 2218005876646727423, 46767874983437110354, 1032732727339665789981

Offset: 0

Tom Roby, May 21 2012

nonn

			From _Alois P. Heinz_, May 22 2012: (Start)
a(3) = 4: {123, 132, 213}, {231}, {312}, {321}.
a(4) = 17: {1234, 1243, 1324, 2134}, {1342}, {1423}, {1432}, {2143}, {2314}, {2341, 2431, 3241}, {2413}, {3124}, {3142}, {3214}, {3412}, {3421}, {4123, 4132, 4213}, {4231}, {4312}, {4321}. (End)

Alois P. Heinz, Table of n, a(n) for n = 0..450
Anders Claesson, From Hertzsprung's problem to pattern-rewriting systems, University of Iceland (2020).
S. Linton, J. Propp, T. Roby, and J. West, Equivalence classes of permutations under various relations generated by constrained transpositions, 2011 arXiv:1111.3920 [math.CO] J. Int. Seq. 15 (2012) #12.9.1

Cf. A210667, A210668, A210669, A210671, A212417, A212580.

my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*(x*(1-x^2)^2/(1-x^3))^k)) \\ Seiichi Manyama, Feb 20 2024

G.f.: Sum_{k>=0} k! * ( x * (1-x^2)^2/(1-x^3) )^k. - Seiichi Manyama, Feb 20 2024

a(9) from Alois P. Heinz, May 22 2012

a(10)-a(22) from Alois P. Heinz, Apr 14 2021

Showing 1-6 of 6 results.

cp's OEIS Frontend

A010551 Multiply successively by 1,1,2,2,3,3,4,4,..., n >= 1, a(0) = 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Formula

A212417 Size of the equivalence class of S_n containing the identity permutation under transformations of positionally adjacent elements of the form abc <--> acb <--> bac where a

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A212580 Number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> acb where a

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A210668 Number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> cba where a

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A210669 Number of equivalence classes of S_n under transformations of positionally adjacent elements of the form abc <--> acb <--> cba where a

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A212581 Number of equivalence classes of S_n under transformations of positionally and numerically adjacent elements of the form abc <--> acb <--> bac where a

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions