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.

A356733 Number of neighborless parts in the integer partition with Heinz number n.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 1
6 0
7 1
8 1
9 1
10 2
11 1
12 0
13 1
14 2
15 0
16 1
17 1
18 0
19 1
20 2
21 2
22 2
23 1
24 0
25 1
26 2
27 1
28 2
29 1
30 0
31 1
32 1
33 2
34 2
35 0
36 0
37 1
38 2
39 2
40 2
41 1
42 1
43 1
44 2
45 0
46 2
47 1
48 0
49 1
50 2
51 2
52 2
53 1
54 0
55 2
56 2
57 2
58 2
59 1
60 0
61 1
62 2
63 2
64 1
65 2
66 1
67 1
68 2
69 2
70 1
71 1
72 0
73 1
74 2
75 0
76 2
77 0
78 1
79 1
80 2
81 1
82 2
83 1
84 1
85 2
86 2
87 2
88 2
89 1
90 0
91 2
92 2
93 2
94 2
95 2
96 0
97 1
98 2
99 2
100 2
101 1
102 1
103 1
104 2
105 0

List of values

[0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 0, 1, 2, 0, 1, 1, 0, 1, 2, 2, 2, 1, 0, 1, 2, 1, 2, 1, 0, 1, 1, 2, 2, 0, 0, 1, 2, 2, 2, 1, 1, 1, 2, 0, 2, 1, 0, 1, 2, 2, 2, 1, 0, 2, 2, 2, 2, 1, 0, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 1, 0, 1, 2, 0, 2, 0, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 2, 1, 0, 2, 2, 2, 2, 2, 0, 1, 2, 2, 2, 1, 1, 1, 2, 0]