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.

A292253 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A252463(n)) + [n == 1 (mod 2)]*[J(3|n) == 1], where J is the Jacobi-symbol.

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 4
6 4
7 8
8 4
9 4
10 8
11 17
12 8
13 35
14 16
15 8
16 8
17 70
18 8
19 140
20 16
21 16
22 34
23 281
24 16
25 9
26 70
27 8
28 32
29 562
30 16
31 1124
32 16
33 32
34 140
35 17
36 16
37 2249
38 280
39 68
40 32
41 4498
42 32
43 8996
44 68
45 16
46 562
47 17993
48 32
49 19
50 18
51 140
52 140
53 35986
54 16
55 32
56 64
57 280
58 1124
59 71973
60 32
61 143947
62 2248
63 32
64 32
65 64
66 64
67 287894
68 280
69 560
70 34
71 575789
72 32
73 1151579
74 4498
75 16
76 560
77 34
78 136
79 2303158
80 64

List of values

[0, 1, 2, 2, 4, 4, 8, 4, 4, 8, 17, 8, 35, 16, 8, 8, 70, 8, 140, 16, 16, 34, 281, 16, 9, 70, 8, 32, 562, 16, 1124, 16, 32, 140, 17, 16, 2249, 280, 68, 32, 4498, 32, 8996, 68, 16, 562, 17993, 32, 19, 18, 140, 140, 35986, 16, 32, 64, 280, 1124, 71973, 32, 143947, 2248, 32, 32, 64, 64, 287894, 280, 560, 34, 575789, 32, 1151579, 4498, 16, 560, 34, 136, 2303158, 64]