[seqfan] Two neighboring digits multiply to a prime

[Eric Angelini]

Hello SeqFans,
same idea -- but multiplying instead of
adding;

> Smallest integer not yet in M such that two neighboring 
> digits of M multiply to a prime:

M = 1,2,12,13,15,17,121,3,131,5,151,7,
171,21,31,51,71,212,1212,1213,1215,
1217,1312,1313,1315,1317,1512,1513,
1517,1712,1713,1715,1717,12121,213,
12131,215,12151,217,...

As it is quite easy to forget one or
more integers when computing M by
hand, could please someone check
this and submit -- if of interest?

Best,
É.