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.

A088208 Table read by rows where T(0,0)=1; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. For j==0 mod 2, T(n+1,2j)=T(n,j) and T(n+1,2j+1)=T(n,j)+2^n. For j==1 mod 2, T(n+1,2j+1)=T(n,j) and T(n+1,2j)=T(n,j)+2^n.

Table of values

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

List of values

[1, 1, 2, 1, 3, 4, 2, 1, 5, 7, 3, 4, 8, 6, 2, 1, 9, 13, 5, 7, 15, 11, 3, 4, 12, 16, 8, 6, 14, 10, 2, 1, 17, 25, 9, 13, 29, 21, 5, 7, 23, 31, 15, 11, 27, 19, 3, 4, 20, 28, 12, 16, 32, 24, 8, 6, 22, 30, 14, 10, 26, 18, 2, 1, 33, 49, 17, 25, 57, 41, 9, 13, 45, 61, 29, 21, 53, 37, 5, 7, 39, 55, 23]