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.

A344625 Number of knapsack partitions of n with largest part 9.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 7, 11, 12, 1, 10, 7, 11, 10, 17, 12, 18, 16, 12, 15, 19, 13, 25, 20, 17, 22, 29, 6, 25, 20, 22, 20, 28, 16, 31, 21, 14, 23, 33, 15, 24, 22, 25, 28, 30, 8, 31, 20, 22, 22, 36, 16, 34, 26, 14, 23, 26, 22, 33, 25, 24]

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

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