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.

A272065 Number of set partitions of [n] such that at least one pair of consecutive blocks (b,b+1) exists having not exactly one pair of consecutive numbers (i,i+1) with i member of b and i+1 member of b+1.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 2
5 17
6 101
7 545
8 2935
9 16351
10 95335
11 583373
12 3745903
13 25208633
14 177505205
15 1305468285
16 10009943248
17 79880835800
18 662319435622
19 5696570446421
20 50749156111271
21 467630493212126
22 4451067568592918
23 43709810099960739
24 442331477265626019

List of values

[0, 0, 0, 0, 2, 17, 101, 545, 2935, 16351, 95335, 583373, 3745903, 25208633, 177505205, 1305468285, 10009943248, 79880835800, 662319435622, 5696570446421, 50749156111271, 467630493212126, 4451067568592918, 43709810099960739, 442331477265626019]