A113085 - cp's OEIS frontend

A113085 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 = 1 and t_i = 1 (mod 2) and t_{i+1} <= 3*t_i for 1

n	a(n)
0	1
1	1
2	3
3	21
4	331
5	11973
6	1030091
7	218626341
8	118038692523
9	166013096151621
10	619176055256353291
11	6207997057962300681573
12	169117528577725378851523691
13	12626174170113987651028630856581
14	2602022118010488151483064379958957003

[1, 1, 3, 21, 331, 11973, 1030091, 218626341, 118038692523, 166013096151621, 619176055256353291, 6207997057962300681573, 169117528577725378851523691, 12626174170113987651028630856581, 2602022118010488151483064379958957003]

cp's OEIS Frontend

A113085 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 = 1 and t_i = 1 (mod 2) and t_{i+1} <= 3*t_i for 1

Table of values

List of values