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.

A134188 a(0)=1. a(n) = the sum of the terms of the sequence (from among terms a(0) through a(n-1)) which equal any "non-isolated divisors" of (2n). A divisor, k, of n is non-isolated if (k-1) or (k+1) also divides n.

Table of values

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

List of values

[1, 1, 2, 4, 4, 4, 16, 4, 4, 4, 28, 4, 32, 4, 4, 4, 4, 4, 52, 4, 56, 4, 4, 4, 68, 4, 4, 4, 4, 4, 88, 4, 4, 4, 4, 4, 108, 4, 4, 4, 120, 4, 124, 4, 4, 4, 4, 4, 144, 4, 148, 4, 4, 4, 160, 4, 4, 4, 4, 4, 180, 4, 4, 4, 4, 4, 200, 4, 4, 4, 212, 4, 216, 4, 4, 4, 4, 4, 236, 4, 240, 4, 4, 4, 252, 4, 4, 4]