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.

A326034 Number of knapsack partitions of n with largest part 3.

Table of values

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

List of values

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

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

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