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.

A271841 Number of set partitions of [2n] having exactly n pairs (m,m+1) such that m is in some block b and m+1 is in block b+1.

Table of values

n a(n)
0 1
1 1
2 6
3 61
4 891
5 17081
6 404275
7 11364373
8 368982178
9 13564841773
10 556179920807
11 25136678260282
12 1240530238800284
13 66339010440041817
14 3819462133549622416
15 235473674234358044731
16 15472450628591543437233
17 1079168872840695090981865
18 79613621745613390178188361

List of values

[1, 1, 6, 61, 891, 17081, 404275, 11364373, 368982178, 13564841773, 556179920807, 25136678260282, 1240530238800284, 66339010440041817, 3819462133549622416, 235473674234358044731, 15472450628591543437233, 1079168872840695090981865, 79613621745613390178188361]

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

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