A335691 -id:A335691 - cp's OEIS frontend

A335692 Inverse BINOMIAL transform of A335691.

1, -1, 2, 0, 72, 1560, 59760, 2983680, 194382720, 15959099520, 1613411654400, 196978231296000, 28577836603008000, 4860382977536486400, 957836230033255372800, 216533832180149772288000, 55662541733368168574976000, 16145371763295690081374208000

Offset: 0

N. J. A. Sloane, Jul 20 2020

sign

a(n)/n! = A000904(n-2) for n >= 2.

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See p. 115, "n! b_{n+1}".

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. [Scan of annotated copy]

Cf. A000166, A000904, A335691.

A335693 A000904(n) - (-1)^n.

Original entry on oeis.org

0, 1, 2, 14, 82, 593, 4820, 43980, 444612, 4934721, 59661254, 780531034, 10987095718, 165586966817, 2660378564776, 45392022568024, 819716784789192, 15620010933562689, 313219935456042954, 6593238655510464742, 145364470356686267258, 3349976056859294611697

Offset: 0

N. J. A. Sloane, Jul 20 2020

nonn

A000179(n) = a(n-2) - a(n-4) for n >= 2. For example A000179(6) = 80 = 82 - 2 = a(4) - a(2).

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See q_n.

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. [Scan of annotated copy]

Cf. A000166, A000904, A335691, A335692.

cp's OEIS Frontend

A335692 Inverse BINOMIAL transform of A335691.

Views

Author

Keywords

Comments

References

Links

Crossrefs