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.

A332895 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 5
6 4
7 10
8 4
9 5
10 10
11 42
12 8
13 21
14 20
15 8
16 8
17 85
18 10
19 170
20 20
21 21
22 84
23 682
24 16
25 11
26 42
27 8
28 40
29 341
30 16
31 2730
32 16
33 85
34 170
35 16
36 20
37 1365
38 340
39 40
40 40
41 5461
42 42
43 10922
44 168
45 17
46 1364
47 43690
48 32
49 23
50 22
51 168
52 84
53 21845
54 16
55 80
56 80
57 341
58 682
59 174762
60 32
61 87381
62 5460
63 40
64 32
65 43
66 170
67 699050
68 340
69 1365
70 32
71 2796202

List of values

[0, 1, 2, 2, 5, 4, 10, 4, 5, 10, 42, 8, 21, 20, 8, 8, 85, 10, 170, 20, 21, 84, 682, 16, 11, 42, 8, 40, 341, 16, 2730, 16, 85, 170, 16, 20, 1365, 340, 40, 40, 5461, 42, 10922, 168, 17, 1364, 43690, 32, 23, 22, 168, 84, 21845, 16, 80, 80, 341, 682, 174762, 32, 87381, 5460, 40, 32, 43, 170, 699050, 340, 1365, 32, 2796202]