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.

A284092 Number of partitions of n into distinct parts 8k+1 or 8k+7.

Table of values

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

List of values

[1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 1, 2, 3, 3, 2, 1, 0, 0, 1, 3, 5, 5, 3, 1, 0, 0, 2, 5, 7, 7, 5, 2, 0, 1, 3, 7, 11, 11, 7, 3, 1, 1, 5, 11, 15, 15, 11, 5, 1, 2, 7, 15, 22, 22, 15, 7, 2, 3, 11, 22, 30, 30, 22, 11, 4, 5, 15, 30, 42, 42]