Table 2 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

132

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

27

206

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

132

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

7

442