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.

A379017 a(n) is the number of distinct sums s(m) + s(m+1) + ... + s(m+n-1), where s = A000002, and m >= 1.

Table of values

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

List of values

[2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 4, 5, 4, 3, 4, 3, 4, 5, 4, 5, 6, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 4, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 7, 6, 7, 6, 5, 6, 7, 6, 7, 8, 7, 8, 7, 6, 7]