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.

A035673 Number of partitions of n into parts 8k and 8k+2 with at least one part of each type.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 4, 0, 4, 0, 4, 0, 4, 0, 10, 0, 11, 0, 11, 0, 11, 0, 22, 0, 25, 0, 26, 0, 26, 0, 44, 0, 51, 0, 54, 0, 55, 0, 84, 0, 98, 0, 105, 0, 108, 0, 153, 0, 178, 0, 193, 0, 200, 0, 269, 0, 313, 0, 341, 0, 356, 0, 459, 0, 531, 0, 582, 0, 611, 0]

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

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