The meeker number sequence
APL (Dyalog Extended), 45 bytes (SBCS)

Full program. Prints all meeker numbers. Requires 0-based indexing (⎕IO←0).
1e6+⍸{(×⌿i⊇⍵)≡10⊥⍵[2+i←0 1,⍪3 4]}¨10⊤¨1e6…1e7

Try it online! (limited to upper bound of 2 000 000 ― above code works offline)
1e6…1e7 numbers 1 000 000 through 10 000 000
10⊤¨ base-10 representation of each (splits digits of numbers into lists of digits)
{…}¨ apply the following lambda to each:
 ⍵[…] index the digits of the current number using the following:
  ⍪3 4 the column-vector [[3],[4]]
  0 1, prepend a column consisting of [0,1] yielding [[0,3],[1,4]]
  i← assign to i (for indices)
  2+ increase by two; [[2,5],[3,6]]
 10⊥ evaluate as base-10, using the top row as tens place and bottom row as ones place
 (…)≡ check if it matches the following:
 i⊇⍵ select the elements from the digits at indices i
 ×⌿ multiply the elements of the top row with the elements of the bottom row
⍸ ɩndices where true
1e6+ offset to the first candidate