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.

A356606 Number of strict integer partitions of n where all parts have neighbors.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 0
5 1
6 1
7 1
8 0
9 2
10 1
11 1
12 2
13 1
14 2
15 3
16 2
17 2
18 5
19 2
20 4
21 5
22 5
23 4
24 8
25 5
26 7
27 9
28 8
29 8
30 13
31 10
32 11
33 16
34 13
35 15
36 20
37 18
38 18
39 27
40 21
41 26
42 31
43 30
44 30
45 43
46 34
47 42
48 49
49 48
50 48
51 65
52 56
53 65
54 76
55 74
56 77
57 97
58 88
59 98
60 117
61 111
62 119
63 143
64 137
65 146
66 175
67 165
68 182
69 208

List of values

[1, 0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 2, 1, 2, 3, 2, 2, 5, 2, 4, 5, 5, 4, 8, 5, 7, 9, 8, 8, 13, 10, 11, 16, 13, 15, 20, 18, 18, 27, 21, 26, 31, 30, 30, 43, 34, 42, 49, 48, 48, 65, 56, 65, 76, 74, 77, 97, 88, 98, 117, 111, 119, 143, 137, 146, 175, 165, 182, 208]

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

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