The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A096965

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A096965

Number of sets of even number of even lists, cf. A000262.
(history; published version)

#27 by Alois P. Heinz at Wed Dec 01 10:54:55 EST 2021

STATUS

editing

approved

#26 by Alois P. Heinz at Wed Dec 01 10:54:44 EST 2021

FORMULA

a(n) = A000262(n) - A096939(n). - _From _Alois P. Heinz_, Dec 01 2021: (Start)

a(n) = A000262(n) - A096939(n).

a(n) = |Sum_{k=0..n} (-1)^k * A349776(n,k)|. (End)

CROSSREFS

Cf. A000262, A088026, A088009, A096939, A349776.

STATUS

approved

editing

#25 by Alois P. Heinz at Wed Dec 01 10:49:20 EST 2021

STATUS

editing

approved

#24 by Alois P. Heinz at Wed Dec 01 10:49:17 EST 2021

CROSSREFS

Cf. A000262, A088026, A088009, A096939.

#23 by Alois P. Heinz at Wed Dec 01 10:45:50 EST 2021

FORMULA

a(n) = A000262(n) - A096939(n). - Alois P. Heinz, Dec 01 2021

CROSSREFS

Cf. A088026, A088009, A096939.

STATUS

approved

editing

#22 by Alois P. Heinz at Wed Dec 01 10:42:11 EST 2021

STATUS

editing

approved

#21 by Alois P. Heinz at Wed Dec 01 10:42:07 EST 2021

MAPLE

a:= proc(n) option remember; `if`(n<4, [1$3, 7][n+1], ((2*n-3)

*a(n-1)+(n-1)*(2*n^2-8*n+7)*a(n-2) + (n-2)*(n-1)*(2*n-5)

*a(n-3)-(n-4)*(n-3)*(n-2)^2*(n-1)*a(n-4))/(n-2))

end:

seq(a(n), n=0..25); # Alois P. Heinz, Dec 01 2021

STATUS

approved

editing

#20 by Alois P. Heinz at Wed Dec 01 10:36:30 EST 2021

STATUS

editing

approved

#19 by Alois P. Heinz at Wed Dec 01 10:36:26 EST 2021

FORMULA

a(n) = (n!*sum(m=floor((n+1)/2)..n, (binomial(n-1,2*m-n-1))/(2*m-n)!)). [ _- _Vladimir Kruchinin_, Mar 10 2013]

STATUS

approved

editing

#18 by OEIS Server at Wed Dec 01 10:35:45 EST 2021

LINKS

Vincenzo Librandi, <a href="/A096965/b096965_1.txt">Table of n, a(n) for n = 0..200</a>