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.

Previous Showing 11-12 of 12 results.

A305785 Number of set partitions of [n] with alternating parity of elements and exactly ceiling(n/2) blocks.

Original entry on oeis.org

1, 1, 1, 2, 3, 7, 14, 33, 84, 204, 627, 1558, 5692, 14402, 60752, 155828, 747046, 1937292, 10385051, 27176489, 161160411, 424958631, 2760858706, 7327447983, 51762453941, 138150105263, 1054164297384, 2827224795106, 23174732414244, 62420125297576, 546984814641114
Offset: 0

Views

Author

Alois P. Heinz, Jun 10 2018

Keywords

Examples

			a(5) = 7: 123|4|5, 12|34|5, 12|3|45, 1|234|5, 145|2|3, 1|2|345, 1|23|45.
		

Crossrefs

Cf. A274581.

Formula

a(n) = A274581(n,ceiling(n/2)).

A305823 Total number of blocks in all set partitions of [n] with alternating parity of elements.

Original entry on oeis.org

0, 1, 3, 8, 20, 53, 136, 383, 1067, 3292, 10162, 34586, 118332, 441898, 1660947, 6745710, 27575425, 120801230, 532530170, 2499230441, 11800052796, 58992236094, 296630364605, 1572128197439, 8378539879636, 46882666240016, 263735138346443, 1552510947814406
Offset: 0

Views

Author

Alois P. Heinz, Jun 10 2018

Keywords

Crossrefs

Cf. A274581.

Formula

a(n) = Sum_{k=0..n} k * A274581(n,k).
Previous Showing 11-12 of 12 results.