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.

A194449 Largest part minus the number of parts > 1 in the n-th region of the set of partitions of j, if 1 <= n <= A000041(j).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 2
7 3
8 1
9 2
10 2
11 2
12 2
13 3
14 3
15 3
16 1
17 2
18 2
19 2
20 4
21 3
22 1
23 2
24 3
25 3
26 3
27 2
28 4
29 4
30 1
31 1
32 2
33 2
34 2
35 4
36 3
37 1
38 3
39 5
40 5
41 4
42 -2
43 2
44 3
45 3
46 3
47 2
48 4
49 4
50 1
51 4
52 3
53 5
54 6
55 5
56 -3
57 1
58 2
59 2
60 2
61 4
62 3
63 1
64 3
65 5
66 5
67 4
68 -2
69 2
70 4
71 4
72 5
73 3
74 6
75 6
76 5
77 -9

List of values

[1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 2, 3, 3, 3, 1, 2, 2, 2, 4, 3, 1, 2, 3, 3, 3, 2, 4, 4, 1, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 3, 3, 3, 2, 4, 4, 1, 4, 3, 5, 6, 5, -3, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 4, 4, 5, 3, 6, 6, 5, -9]