Table 3 Sequence, in reverse order, of the numbers of consecutive values n∈[2¹³,2¹⁴) such that the trees \(T_{n;l_{1},\ldots,l_{j}}\) achieving the minimum V value on \(\mathcal {BT}^{*}_{n}\) have the same l₁,…,l_j

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

1

130

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

28

204

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

1

130

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

13

302

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

1

130

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

28

204

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

1

130

29

2

25

12

29

2

18

28

29

2

25

12

29

2

7

52

29

2

25

12

29

2

18

28

29

2

25

12

21

88

29

2

25

12

29

2

18

28

29

2

25

12

26

598