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.

A270955 Number of set partitions of [n] having exactly one pair (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)
3 1
4 6
5 24
6 91
7 374
8 1699
9 8410
10 44794
11 254718
12 1538027
13 9818858
14 66030017
15 466215802
16 3446197857
17 26600048069
18 213901723087
19 1788292021799
20 15514751860549
21 139443578638933
22 1296371888068649
23 12448726758061263
24 123316489529161713
25 1258632265803403708

List of values

[1, 6, 24, 91, 374, 1699, 8410, 44794, 254718, 1538027, 9818858, 66030017, 466215802, 3446197857, 26600048069, 213901723087, 1788292021799, 15514751860549, 139443578638933, 1296371888068649, 12448726758061263, 123316489529161713, 1258632265803403708]

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

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