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.

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

Table of values

n a(n)
6 1
7 21
8 197
9 1421
10 9573
11 64724
12 449567
13 3230230
14 24053169
15 185658621
16 1484943532
17 12299106220
18 105400873263
19 933717036862
20 8541991253431
21 80620086997245
22 784225175253212
23 7854824886117957
24 80933906884404094
25 857116366195307414
26 9321782438290435408

List of values

[1, 21, 197, 1421, 9573, 64724, 449567, 3230230, 24053169, 185658621, 1484943532, 12299106220, 105400873263, 933717036862, 8541991253431, 80620086997245, 784225175253212, 7854824886117957, 80933906884404094, 857116366195307414, 9321782438290435408]

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

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