A253580 - cp's OEIS frontend

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

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

[0, 1, 0, 2, 3, 1, 0, 2, 4, 5, 3, 1, 0, 2, 4, 6, 7, 5, 3, 1, 0, 2, 4, 6, 8, 9, 7, 5, 3, 1, 0, 2, 4, 6, 8, 10, 11, 9, 7, 5, 3, 1, 0, 2, 4, 6, 8, 10, 12, 13, 11, 9, 7, 5, 3, 1, 0, 2, 4, 6, 8, 10, 12, 14, 15, 13, 11, 9, 7, 5, 3, 1, 0, 2, 4, 6, 8, 10, 12, 14, 16]

cp's OEIS Frontend

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

Table of values

List of values

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

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

cp's OEIS Frontend

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

Table of values

List of values

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

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