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.

A336767 The number of partitions of n into an even number of parts, each part occurring at most seven times, minus the number of partitions of n into an odd number of parts, each part occurring at most seven times.

Table of values

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

List of values

[1, -1, 0, -1, 1, -1, 1, -1, 1, -1, 2, -1, 2, -2, 2, -3, 2, -2, 3, -3, 3, -4, 4, -4, 4, -5, 5, -6, 6, -6, 7, -7, 7, -8, 9, -9, 10, -10, 11, -12, 13, -13, 14, -15, 15, -17, 18, -18, 20, -21, 22, -23, 24, -25, 27, -29, 30, -32, 33, -35, 37, -39, 40, -43, 45, -47, 50]

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

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