Stijn Dierckx has authored 2 sequences.
A331882
a(n) is the number of digits in the decimal expansion of the fractional part of Pi needed to contain n occurrences of an n-digit substring.
Original entry on oeis.org
1, 22, 219, 1805, 25499, 168882, 3566679, 29325629
Offset: 1
a(1) = 1, because we need 1 digit to have the first 1-digit substring ('1') appearing 1 time;
a(2) = 22, because we need 22 digits (1415926535897932384626) to have the first 2-digit substring ('26') appearing 2 times;
a(3) is 219, because we need 219 digits (1415....933446) to have the first 3-digit substring ('446') appearing 3 times;
and so on.
A331881
a(n) is the first n-digit substring to occur n times in the decimal expansion of the fractional part of Pi.
Original entry on oeis.org
1, 26, 446, 2796, 86538, 872117, 1591292, 66416662
Offset: 1
a(1) = 1, because '1' is the first 1-digit string appearing 1 time (at position 1);
a(2) = 26, because '26' is the first 2-digit string appearing 2 times (at positions 6 and 21);
a(3) = 446, because '446' is the first 3-digit string appearing 3 times (at positions 125, 182 and 217);
and so on.
Cf.
A331882 (the number of digits needed to find the repeated n-digit strings).