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.

A344412 Number of knapsack partitions of n with largest part 7.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 7, 1, 6, 5, 8, 7, 10, 8, 8, 9, 11, 8, 13, 11, 13, 5, 14, 8, 13, 10, 17, 12, 8, 10, 14, 13, 14, 12, 18, 3, 15, 11, 15, 14, 17, 12, 8, 12, 15, 13, 20, 12, 14, 5, 17, 15, 17, 10, 18, 14, 9, 13, 18, 13, 15, 15, 18, 5, 18, 11]

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

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