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.

A035447 Number of partitions of n into parts 8k or 8k+7.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 2, 0, 0, 0, 0, 1, 2, 4, 3, 0, 0, 0, 1, 2, 5, 7, 5, 0, 0, 1, 2, 5, 9, 12, 7, 0, 1, 2, 5, 10, 17, 19, 11, 1, 2, 5, 10, 19, 28, 30, 16, 2, 5, 10, 20, 33, 47, 46, 24, 5, 10, 20, 35, 57, 74, 69, 35, 10, 20, 36, 62, 93, 116, 102, 52, 20, 36, 64]

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

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