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.

A360659 a(n) is the minimum sum of a completely multiplicative sign sequence of length n.

Table of values

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

List of values

[0, 1, 0, -1, 0, -1, 0, -1, -2, -1, 0, -1, -2, -3, -4, -3, -2, -3, -4, -5, -4, -5, -4, -5, -6, -5, -6, -7, -8, -9, -8, -9, -8, -7, -8, -7, -6, -7, -8, -7, -8, -9, -10, -11, -12, -13, -14, -15, -14, -13, -12, -13, -14, -15, -14, -13, -14, -15, -16, -17, -18, -19]