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.

A270964 Number of set partitions of [n] having exactly ten 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)
15 1
16 281
17 13297
18 348523
19 6807872
20 113042841
21 1709159987
22 24469725009
23 339634663517
24 4638106688642
25 62916588549562
26 853199404241913
27 11616795214297568
28 159290998975659690
29 2204454156023259166
30 30838108887627521579
31 436552647970998600862
32 6258905749718943712307

List of values

[1, 281, 13297, 348523, 6807872, 113042841, 1709159987, 24469725009, 339634663517, 4638106688642, 62916588549562, 853199404241913, 11616795214297568, 159290998975659690, 2204454156023259166, 30838108887627521579, 436552647970998600862, 6258905749718943712307]

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

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