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.

A097586 Table T(n,n) read by rows: T(1,1)=0; then if n even T(n,1)=T(n-1,1)+2 and if n odd T(n,1)=T(n-2,1)+T(n-1,1)-1 then T(n,j)=T(n,j-1) + 2^floor((n+1)/2).

Table of values

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

List of values

[0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 5, 9, 13, 17, 21, 25, 29, 33, 37, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 3, 11, 19, 27, 35, 43, 51, 59, 67, 75, 5, 13, 21, 29, 37, 45, 53, 61, 69, 77, 7, 23, 39, 55, 71, 87, 103, 119, 135, 151, 9, 25, 41, 57, 73]