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.

A344635 Number of knapsack partitions of n with largest part 10.

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 7, 11, 12, 17, 1, 13, 9, 16, 11, 20, 14, 24, 16, 25, 9, 27, 14, 29, 19, 32, 16, 34, 19, 37, 11, 32, 17, 38, 19, 32, 22, 41, 19, 40, 14, 38, 22, 41, 22, 39, 18, 44, 26, 46, 8, 46, 24, 38, 23, 40, 21, 48, 28, 42, 12]

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

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