This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A160215 #11 Aug 02 2015 02:07:50
%S A160215 2,5,13,17,29,37,53,61,101,109,113,149,157,173,181,193,197,229,241,
%T A160215 257,269,277,293,317,337,349,373,389,397,401,421,433,449,461,509,541,
%U A160215 557,577,593,613,653,661,677,701,709,733,757,769,773,797,821,829,853,877
%N A160215 Primes congruent to 2^k+1 (mod 2^(k+1)), where k is any even integer >=0.
%C A160215 If A(x) is the counting function of the terms not exceeding x, then A(x) grows similarly to Pi(x)/3, see A000720.
%C A160215 Lim_{x -> inf.} the number of terms < x in A160216/A160215 => 2. - _Robert G. Wilson v_, May 31 2009
%H A160215 Vincenzo Librandi, <a href="/A160215/b160215.txt">Table of n, a(n) for n = 1..2000</a>
%F A160215 A000040 \ A160216.
%F A160215 {prime(k) : A023506(k) is even}. - _R. J. Mathar_, May 08 2009
%t A160215 fQ[n_] := Mod[ Flatten[ FactorInteger[n - 1]] [[2]], 2] == 0; Select[ Prime@ Range@ 155, fQ@# &] (* _Robert G. Wilson v_, May 31 2009 *)
%Y A160215 Cf. A000040.
%K A160215 nonn
%O A160215 1,1
%A A160215 _Vladimir Shevelev_, May 04 2009
%E A160215 Edited by _R. J. Mathar_, May 08 2009
%E A160215 More terms from _Robert G. Wilson v_, May 31 2009