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.

A035442 Number of partitions of n into parts 8k or 8k+2.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 0
6 1
7 0
8 2
9 0
10 3
11 0
12 3
13 0
14 3
15 0
16 5
17 0
18 7
19 0
20 8
21 0
22 8
23 0
24 11
25 0
26 15
27 0
28 17
29 0
30 18
31 0
32 23
33 0
34 30
35 0
36 35
37 0
38 37
39 0
40 45
41 0
42 57
43 0
44 66
45 0
46 71
47 0
48 84
49 0
50 104
51 0
52 121
53 0
54 131
55 0
56 151
57 0
58 183
59 0
60 212
61 0
62 231
63 0
64 263
65 0
66 313
67 0
68 362
69 0
70 396
71 0
72 446
73 0
74 523
75 0
76 601
77 0
78 660
79 0

List of values

[0, 1, 0, 1, 0, 1, 0, 2, 0, 3, 0, 3, 0, 3, 0, 5, 0, 7, 0, 8, 0, 8, 0, 11, 0, 15, 0, 17, 0, 18, 0, 23, 0, 30, 0, 35, 0, 37, 0, 45, 0, 57, 0, 66, 0, 71, 0, 84, 0, 104, 0, 121, 0, 131, 0, 151, 0, 183, 0, 212, 0, 231, 0, 263, 0, 313, 0, 362, 0, 396, 0, 446, 0, 523, 0, 601, 0, 660, 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.