login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346720 a(n) is the number of negative Euler permutations of order 2*n. Bisection (even indices) of A347602. 3
0, 1, 2, 163, 6724, 692741, 86756038, 16135231015, 3838836369800, 1178853270354697, 447322130002332298, 206783054242756958891, 114117348385587556703692, 74183362210489714472590093, 56080450787901009525514063694, 48790757690364513377740990959151, 48400123863374755985614486072403728 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

For definitions and comments see A347602.

LINKS

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

FORMULA

A346719(n) + a(n) = A000166(2n) (rencontres numbers).

A346719(n) - a(n) = A000364(n) (Euler secant numbers).

a(n) = subfactorial(2*n) / 2 - Im(PolyLog(-2*n, i)).

MAPLE

# uses A000166.

A346720 := n -> (A000166(2*n) - euler(2*n)) / 2:

seq(A346720(n), n = 0..16);

MATHEMATICA

A346720[n_] := Subfactorial[2 n]/2 - Im[PolyLog[-2 n, I]];

Table[A346720[n], {n, 0, 16}]

CROSSREFS

Cf. A347601, A346719, A000166, A000364, A347602.

Sequence in context: A300363 A109420 A162904 * A259319 A230912 A339009

Adjacent sequences:  A346717 A346718 A346719 * A346727 A346728 A346729

KEYWORD

nonn

AUTHOR

Peter Luschny, Sep 09 2021

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 October 18 08:45 EDT 2021. Contains 348067 sequences. (Running on oeis4.)