>>704 追記
For l1 = m To 1 Step -1
a = 0
b = Int((n - 1) / lPrimes(l1))
lSkip = -1
lMax = 0
For l = 0 To n - 2
p = n ^ 2 + 1 + l
If p Mod lPrimes(l1) = 0 Then
If pFlags(l) Then
a = a + 1
For l2 = l1 - 1 To 1 Step -1
If bCombinations(l, l2) Then
If lSkip = -1 Then
lSkip = l
lMax = l2
Exit For
Else
If l2 > lMax Then
lSkip = l
lMax = l2
Exit For
End If
End If
End If
Next
End If
End If
Next