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.

A253146 A fractal tree, read by rows: for n > 2, T(n,1) = T(n-1,1)+2, T(n,n) = T(n-1,1)+3, and for k=2..n-1, T(n,k) = T(n-2,k-1).

Table of values

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

List of values

[1, 2, 3, 4, 1, 5, 6, 2, 3, 7, 8, 4, 1, 5, 9, 10, 6, 2, 3, 7, 11, 12, 8, 4, 1, 5, 9, 13, 14, 10, 6, 2, 3, 7, 11, 15, 16, 12, 8, 4, 1, 5, 9, 13, 17, 18, 14, 10, 6, 2, 3, 7, 11, 15, 19, 20, 16, 12, 8, 4, 1, 5, 9, 13, 17, 21, 22, 18, 14, 10, 6, 2, 3, 7, 11, 15, 19, 23]

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

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