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.

A342684 Number of knapsack partitions of n with largest part 8.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 7, 11, 1, 8, 6, 10, 7, 13, 9, 15, 6, 12, 10, 15, 8, 18, 10, 17, 6, 17, 12, 17, 9, 18, 13, 22, 7, 19, 10, 19, 13, 20, 14, 24, 4, 20, 12, 19, 13, 23, 15, 21, 4, 20, 13, 23, 11, 23, 15, 20, 7, 20, 12, 22, 15, 24, 12, 22]

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

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