[seqfan] A tricky sequence [A307720]

[Éric Angelini]

Hello SeqFans,
a difficult challenge for your computer (and the quantity
of memory it has):

What is the smallest "n" here such that a(n) = 2019?

The sequence exists only so far as a draft in the OEIS:
https://oeis.org/draft/A307720
	
It says:
Lexicographically earliest sequence starting with a(1) = 1 
where a(n) is the number of pairs of contiguous terms whose
product is a(n).

DATA	
1, 1, 2, 1, 3, 1, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 3, 3, 
3, 3, 3, 3, 3, 3, 4, 2, 4, 2, 4, 2, 4, 2, 4, 3, 4, 3, 4, 3, 
4, 3, 4, 3, 4, 3, 5, 1, 5, 1, 5, 1, 7, 1, 7, 1, 7, 1, 7, 2,
5, 2, 5, 2,...

A307720 will show all natural numbers sooner or later -- but,
ahem, more "later" than "sooner"! So, what about 2019?

The "twin" sequence was published yesterday (Belgium's time):
https://oeis.org/A307707

Best,
É.