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 A122711 #25 Oct 11 2016 19:25:07
%S A122711 106976,1642796,21879936,96593696,6926872352,21235295216,24936246176,
%T A122711 25867010016,80832867116,82230049056,208329074876,360598467776,
%U A122711 533800559216,587627376176,661575990912,662312961696,664490433776,737374205276,831623487276,1052816473676,1137732817376,1213045642656,1270015920636
%N A122711 Even numbers n such that n+2 divides n+2^n.
%C A122711 Same as even numbers n such that 2^n == 2 (mod n+2). - _Robert G. Wilson v_, Sep 27 2006
%C A122711 n must be a multiple of 4. A002326(n/4) must not be divisible by 2 or 3. If p is an odd prime factor of n+2, (n+2)/p mod A002326((p-1)/2)=3. - _Martin Fuller_, Oct 09 2006
%C A122711 Also, the positive numbers A015922(k)-2 that are multiples of 4. E.g., a(1) = 106976 = A015922(3926)-2. Hence, a(n)+2 forms a subsequence of A015922 (and of A130134) consisting of the terms congruent to 2 modulo 4. - _Max Alekseyev_, Apr 03 2014
%H A122711 Max Alekseyev, <a href="/A122711/b122711.txt">Table of n, a(n) for n = 1..110</a> (all terms below 10^15)
%t A122711 Do[ If[ PowerMod[2, 2n, 2n + 2] == 2, Print@2n], {n, 10^9}] (* _Robert G. Wilson v_, Sep 27 2006 *)
%Y A122711 Cf. A081765, A015922, A122042.
%K A122711 nonn
%O A122711 1,1
%A A122711 _Zak Seidov_, Sep 23 2006
%E A122711 More terms from _Max Alekseyev_, Sep 23 2006, Oct 01 2006
%E A122711 More terms from _Martin Fuller_, Oct 09 2006
%E A122711 Terms a(18) onward from _Max Alekseyev_, Apr 09 2014
%E A122711 b-file corrected by _Max Alekseyev_, Oct 11 2016