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.

A271790 Number of set partitions of [n] having exactly three 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)
3 0
4 1
5 10
6 61
7 313
8 1520
9 7373
10 36627
11 188396
12 1007708
13 5612677
14 32551400
15 196447095
16 1232448403
17 8028591686
18 54240974862
19 379574487845
20 2748022434268
21 20558256639096
22 158746877185099
23 1263892981174760
24 10364745848886935
25 87464284123646375
26 758804198576946316

List of values

[0, 1, 10, 61, 313, 1520, 7373, 36627, 188396, 1007708, 5612677, 32551400, 196447095, 1232448403, 8028591686, 54240974862, 379574487845, 2748022434268, 20558256639096, 158746877185099, 1263892981174760, 10364745848886935, 87464284123646375, 758804198576946316]

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

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