Answer. Yes.
Sequence (an) starts with values 2, 14, 198, 2786, 39202, 551614. Sequence (bn) starts with values 2, 14, 82, 478, 2786, 16238, 94642, 551614. We therefore conjecture that a2k+1=b3k+1 holds for k≥0.
Shifting the recurrence yields
an+2−14an+1−an=0,an+1−14an−an−1=0,an−14an−1−an−2=0
for n≥2. Multiplying these recurrences by 1, 14 and −1, respectively, and taking the sum yields an+2−198an+an−2=0 and thus
an+2=198an−an−2
for n≥2.
Shifting the recurrence of (bn) yields
bn+3−6bn+2+bn+1bn+2−6bn+1+bnbn+1−6bn+bn−1bn−6bn−1+bn−2bn−1−6bn−2+bn−3=0,=0,=0,=0,=0
for n≥3. Multiplying these recurrences by 1, 6, 35, 6 and 1, respectively, and taking the sum yields bn+3−198bn+bn−3=0 and thus
bn+3=198bn−bn−3
for n≥3.
We see that the subsequences (a2k+1) and (b3k+1) have the same initial values a1=b1=14 and a3=b4=2786 and fulfil the same recurrence. This implies that a2k+1=b3k+1 for all k≥0.
From the given recurrence, it is obvious that the sequence (an) is strictly increasing. Thus we also get infinitely many values which occur in both sequences.