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.

A292590 a(1) = 0; and for n > 1, a(n) = 2*a(A285712(n)) + [0 == (n mod 3)].

Table of values

n a(n)
1 0
2 0
3 1
4 2
5 0
6 5
7 10
8 2
9 21
10 42
11 4
12 85
13 0
14 0
15 171
16 342
17 10
18 5
19 684
20 20
21 1369
22 2738
23 4
24 5477
25 0
26 42
27 10955
28 8
29 84
30 21911
31 43822
32 8
33 21
34 87644
35 170
36 175289
37 350578
38 0
39 11
40 701156
41 0
42 1402313
43 40
44 342
45 2804627
46 16
47 684
48 85
49 5609254
50 20
51 11218509
52 22437018
53 10
54 44874037
55 89748074
56 1368
57 179496149
58 168
59 40
60 43
61 0
62 2738
63 1
64 358992298
65 5476
66 717984597
67 80
68 8

List of values

[0, 0, 1, 2, 0, 5, 10, 2, 21, 42, 4, 85, 0, 0, 171, 342, 10, 5, 684, 20, 1369, 2738, 4, 5477, 0, 42, 10955, 8, 84, 21911, 43822, 8, 21, 87644, 170, 175289, 350578, 0, 11, 701156, 0, 1402313, 40, 342, 2804627, 16, 684, 85, 5609254, 20, 11218509, 22437018, 10, 44874037, 89748074, 1368, 179496149, 168, 40, 43, 0, 2738, 1, 358992298, 5476, 717984597, 80, 8]