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.

A246694 Triangle read by rows: T(n,k) = T(n,k-2) + 1 if n > 1 and 2 <= k <= n; T(0,0) = 1, T(1,0) = 1, T(1,1) = 2; if n > 1 is odd, then T(n,0) = T(n-1,n-2) + 1 and T(n,1) = T(n-1,n-1) + 1; if n > 1 is even, then T(n,0) = T(n-1,n-1) + 1 and T(n,1) = T(n-1,n-2) + 1.

Table of values

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

List of values

[1, 1, 2, 3, 2, 4, 3, 5, 4, 6, 7, 5, 8, 6, 9, 7, 10, 8, 11, 9, 12, 13, 10, 14, 11, 15, 12, 16, 13, 17, 14, 18, 15, 19, 16, 20, 21, 17, 22, 18, 23, 19, 24, 20, 25, 21, 26, 22, 27, 23, 28, 24, 29, 25, 30, 31, 26, 32, 27, 33, 28, 34, 29, 35, 30, 36, 31, 37, 32]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.