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.

A246696 Triangle t(n,k) = t(n,k-2) + 2 if n > 1 and 2 <= k <= n; t(0,0) = 1, t(1,0) = 2, t(1,1) = 3; if n > 1 is odd, then t(n,0) = t(n-1,n-2) + 2 and t(n,1) = t(n-1,n-1) + 2; if n > 1 is even, then t(n,0) = t(n-1,n-1) + 2 and t(n,1) = t(n-1,n-2) + 2.

Table of values

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

List of values

[1, 2, 3, 5, 4, 7, 6, 9, 8, 11, 13, 10, 15, 12, 17, 14, 19, 16, 21, 18, 23, 25, 20, 27, 22, 29, 24, 31, 26, 33, 28, 35, 30, 37, 32, 39, 41, 34, 43, 36, 45, 38, 47, 40, 49, 42, 51, 44, 53, 46, 55, 48, 57, 50, 59, 61, 52, 63, 54, 65, 56, 67, 58, 69, 60, 71, 62]