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.

A290737 Weighted count of partitions of 2n+1 into odd parts in which the largest part appears an odd number of times and all other parts appear twice, with respect to a certain weight.

Table of values

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

List of values

[1, 2, 1, 1, 2, -1, 1, 3, -2, 1, 2, 0, 2, 1, 0, -1, 5, 2, -1, 2, -3, 5, 3, -1, 2, 0, 1, 1, 2, -2, 2, 5, 2, -4, 0, 1, -1, 6, 0, 4, -3, -1, 3, -1, 2, 0, 4, -2, 2, 4, -2, 1, 5, -2, -2, -2, 4, 6, 1, 3, -2, 4, -3, -1, -2, 4, 6, 2, 0, -4, 5, 1, 3, -1, 0, 0, 4, -1, -2, 4, -2, 2, 5, 2, 5, -5, -2, 6, -4, 0, -3]