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 A192109 #43 Nov 10 2023 09:23:52
%S A192109 1,2,6,10,14,22,26,30,34,38,46,58,62,74,82,86,94,106,118,122,134,142,
%T A192109 146,158,166,170,178,182,194,202,206,214,218,226,254,262,274,278,298,
%U A192109 302,314,326,334,346,358,362,382,386,394,398,422,446,454,458,466,478,482,502,514,526,538,542,554,562,566,586,614,622,626
%N A192109 Numbers k that divide 2^(k-1) - 2.
%H A192109 Amiram Eldar, <a href="/A192109/b192109.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Reinhard Zumkeller)
%t A192109 Join[{1,2},Select[Range[700],PowerMod[2,#-1,#]==2&]] (* _Harvey P. Dale_, May 15 2015 *)
%o A192109 (Haskell)
%o A192109 import Data.List (elemIndices)
%o A192109 a192109 n = a192109_list !! (n-1)
%o A192109 a192109_list = map (+ 1) $ elemIndices 0 $ zipWith mod a000918_list [1..]
%o A192109 -- _Reinhard Zumkeller_, Apr 23 2013
%o A192109 (PARI) is(n)=Mod(2,n)^(n-1)==2 \\ _Charles R Greathouse IV_, Nov 04 2016
%Y A192109 Contains A216090 as subsequence.
%Y A192109 Subsequence of A015921, consisting of the terms that are not multiples of 4.
%Y A192109 The odd terms form A173572.
%Y A192109 Cf. A014741, A000918.
%K A192109 nonn
%O A192109 1,2
%A A192109 _Max Alekseyev_, Apr 22 2013