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.

A271788 Number of set partitions of [n] having exactly one pair (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)
1 0
2 1
3 3
4 7
5 16
6 39
7 105
8 314
9 1035
10 3723
11 14494
12 60670
13 271544
14 1293147
15 6523495
16 34724247
17 194357190
18 1140402612
19 6995760364
20 44760085240
21 298054873358
22 2061644525813
23 14787185811993
24 109804829195145
25 842928183558160
26 6680572760715182
27 54595535222727960

List of values

[0, 1, 3, 7, 16, 39, 105, 314, 1035, 3723, 14494, 60670, 271544, 1293147, 6523495, 34724247, 194357190, 1140402612, 6995760364, 44760085240, 298054873358, 2061644525813, 14787185811993, 109804829195145, 842928183558160, 6680572760715182, 54595535222727960]

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

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