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.

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

Table of values

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

List of values

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