
COMMENTS

next term a(23) = 47*2^583+1 > 10^177. Sequence then continues: 197, 103, 107, 881, 229, 1889, 977, 127, 131, 269, 139, 569, 293, 151, 617, 317, 163, 167, 1361, 349, 179, 23297, 373, 191, 389, 199, 809, ...
If no such prime exists for any m then 2n+1 is called a Sierpinski number. One could use a(n) = 0 for these cases. E.g., a(39278) = 0 because 78557 is a Sierpinski number. For the corresponding numbers m see A046067(n+1), n >= 0, where 1 entries corresponds to a(n) = 0. See also the Sierpinski links there.  Wolfdieter Lang, Feb 07 2013.
