A113089 - cp's OEIS frontend

A113089 Number of 3-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 2) and t_{i+1} <= 3*t_i for 1

n	a(n)
0	1
1	2
2	10
3	114
4	2970
5	182402
6	27392682
7	10390564242
8	10210795262650
9	26494519967902114
10	184142934938620227530
11	3466516611360924222460082
12	178346559667060145108789818842
13	25264074391478558474014952210052802

[1, 2, 10, 114, 2970, 182402, 27392682, 10390564242, 10210795262650, 26494519967902114, 184142934938620227530, 3466516611360924222460082, 178346559667060145108789818842, 25264074391478558474014952210052802]

cp's OEIS Frontend

A113089 Number of 3-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 2) and t_{i+1} <= 3*t_i for 1

Table of values

List of values