cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A347597 a(n) = Permanent(T(2*n + 1)) where T(n) is the tangent matrix defined in A346831. Bisection of A347598 (odd indices).

Original entry on oeis.org

0, 2, -12, 230, -6936, 316682, -20359332, 1754340590, -195242324016, 27266796955922, -4669829301365052, 962523286888757750, -235056895264868039496, 67119429827860669710362
Offset: 0

Views

Author

Peter Luschny, Sep 14 2021

Keywords

Crossrefs

Cf. A347598, A346831.

A347601 a(n) is the number of positive Euler permutations of order n.

Original entry on oeis.org

1, 0, 0, 2, 7, 16, 102, 1042, 8109, 63280, 642220, 7500626, 89458803, 1135216800, 15935870034, 241410428162, 3858227881945, 65327424977824, 1176448390679256, 22388999178300514, 447692501190569823, 9395318712874789744, 206713705368363820990, 4755693997171333347506
Offset: 0

Views

Author

Peter Luschny, Sep 10 2021

Keywords

Comments

Let M be the tangent matrix of dimension n X n. The definition of the tangent matrix is given in A346831. An Euler permutation of order n is a permutation sigma of {1,...,n} if P = Product_{k=1..n} M(k, sigma(k)) does not vanish. We say sigma is a positive Euler permutation of order n (or sigma in EP(n)) if P = 1 and a negative Euler permutation of order n (or sigma in EN(n)) if P = -1.
a(n) = card(EP(n)), the number of positive Euler permutations of order n. A table of positive Euler permutations is given in A347766. Related sequences are A347599 (Genocchi permutations) and A347600 (Seidel permutations).

Examples

			Illustrating the decomposition of the rencontres numbers and the Euler numbers:
The third column is the sum of the first two columns and the fourth column is the difference between the first two. The fourth column is the sum of the last two.
[n]  A347601     A347602      A000166       A347598      A122045   A347597
--------------------------------------------------------------------------
[ 0] 1,           0,           1,            1,          1,          [0]
[ 1] 0,           0,           0,            0,          0,          0,
[ 2] 0,           1,           1,           -1,         -1,          [0]
[ 3] 2,           0,           2,            2,          0,          2,
[ 4] 7,           2,           9,            5,          5,          [0]
[ 5] 16,          28,          44,          -12,         0,         -12,
[ 6] 102,         163,         265,         -61,        -61,         [0]
[ 7] 1042,        812,         1854,         230,        0,          230,
[ 8] 8109,        6724,        14833,        1385,       1385,       [0]
[ 9] 63280,       70216,       133496,      -6936,       0,         -6936,
[10] 642220,      692741,      1334961,     -50521,     -50521,      [0].

Crossrefs

Cf. A000166, A122045, A346831, A347597, A347598, A347602 (neg. perm.), A347766 (table), A347599, A347600, A346719 (bisection even indices).

Programs

  • Julia
    using Combinatorics
function TangentMatrix(N)
    M = zeros(Int, N, N)
    H = div(N + 1, 2)
    for n in 1:N - 1
        for k in 0:n - 1
            M[n - k, k + 1] = n < H ? 1 : -1
            M[N - n + k + 1, N - k] = n < N - H ? -1 : 1
        end
    end
M end
function EulerPermutations(n, sgn)
    M = TangentMatrix(n)
    S = 0
    for p in permutations(1:n)
        sgn == prod(M[k, p[k]] for k in 1:n) && (S += 1)
    end
S end
PositiveEulerPermutations(n) = EulerPermutations(n, 1)
  • Maple
    # Uses function TangentMatrix from A346831.
EulerPermutations := proc(n, sgn) local M, P, N, s, p, m;
   M := TangentMatrix(n); P := 0; N := 0;
   for p in Iterator:-Permute(n) do
      m := mul(M[k, p(k)], k = 1..n);
      if m =  0 then next fi;
      if m =  1 then P := P + 1 fi;
      if m = -1 then N := N + 1 fi; od;
   if sgn = 'pos' then P else N fi end:
A347601 := n -> `if`(n = 0, 1, EulerPermutations(n, 'pos')):
seq(A347601(n), n = 0..8);

Formula

Let |S| denote the cardinality of a set S. Following identities hold for n >= 0:
a(n) + A347602(n) = |EP(n) | + |EN(n) | = A000166(n) (rencontres numbers),
a(2n) - A347602(2n) = |EP(2n)| - |EN(2n)| = A122045(n) (Euler numbers),
a(n) - A347602(n) = |EP(n) | - |EN(n) | = A347598(n).

A347602 a(n) is the number of negative Euler permutations of order n.

Original entry on oeis.org

0, 0, 1, 0, 2, 28, 163, 812, 6724, 70216, 692741, 7183944, 86756038, 1155576132, 16135231015, 239656087572, 3838836369800, 65522667301840, 1178853270354697, 22361732381344592, 447322130002332298, 9399988542176154796, 206783054242756958891, 4754731473884444589756
Offset: 0

Views

Author

Peter Luschny, Sep 10 2021

Keywords

Comments

Let M be the tangent matrix of dimension n X n. The definition of the tangent matrix is given in A346831. An Euler permutation of order n is a permutation sigma of {1,...,n} if P = Product_{k=1..n} M(k, sigma(k)) does not vanish. We say sigma is a positive Euler permutation of order n (or sigma in EP(n)) if P = 1 and a negative Euler permutation of order n (or sigma in EN(n)) if P = -1.
a(n) = card(EN(n)), the number of negative Euler permutations of order n. A table of negative Euler permutations is given in A347767. Related sequences are A347599 (Genocchi permutations) and A347600 (Seidel permutations).

Crossrefs

Cf. A000166, A122045, A346831, A347597, A347598, A347601 (pos. perm.), A347767 (table), A347599, A347600, A346720 (bisection even indices).

Programs

  • Maple
    # Uses function EulerPermutations from A347601.
A347602 := n -> `if`(n = 0, 0, EulerPermutations(n, 'neg')):
seq(A347602(n), n = 0..8);

Formula

Let |S| denote the cardinality of a set S. Following identities hold for n >= 0:
A347601(n) + a(n) = |EP(n) | + |EN(n) | = A000166(n) (rencontres numbers),
A347601(2n) - a(2n) = |EP(2n)| - |EN(2n)| = A122045(n) (Euler numbers),
A347601(n) - a(n) = |EP(n) | - |EN(n) | = A347598(n).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.