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.

A376077 Number of partitions of subsets of [n] containing n > 0, where consecutive integers are required to be in different parts.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 19
5 68
6 269
7 1168
8 5516
9 28117
10 153668
11 895345
12 5534292
13 36137736
14 248364343
15 1790801964
16 13508326353
17 106329846806
18 871423555238
19 7420685528453
20 65539734707912
21 599363070599885
22 5666859173305898
23 55317197561841526
24 556788566486730535

List of values

[1, 1, 2, 6, 19, 68, 269, 1168, 5516, 28117, 153668, 895345, 5534292, 36137736, 248364343, 1790801964, 13508326353, 106329846806, 871423555238, 7420685528453, 65539734707912, 599363070599885, 5666859173305898, 55317197561841526, 556788566486730535]