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 A292911 #30 Sep 29 2017 17:09:44
%S A292911 1,3,7,9,15,19,21,27,31,37,45,49,51,55,57,69,75,79,87,91,97,99,115,
%T A292911 117,121,129,135,139,141,147,157,159,169,175,177,187,195,199,201,205,
%U A292911 211,217,225,229,231,255,261,271,279,285,289,297,301,307,309,321,327
%N A292911 Numbers n such that A291897(n) is divisible by (2*n-1)^3.
%C A292911 Conjecture: Every prime of the form 4*k+1 (A002144) is contained in the sequence {2*a(n)-1}.
%C A292911 The author's former conjecture that, for n>=2 the numbers {2*a(n)-1} are consecutive primes of the form 4*k+1, was disproved at n = 553 by _Peter J. C. Moses_. (553*2 - 1 = 1105 is the smallest term which is a product of three distinct (4*k+1)-primes). - _Vladimir Shevelev_, Sep 27 2017
%C A292911 553 is also (after 1) the smallest number which is missing from A119681 but is present here. - _R. J. Mathar_, Sep 29 2017
%H A292911 Michael De Vlieger, <a href="/A292911/b292911.txt">Table of n, a(n) for n = 1..500</a>
%H A292911 Michael De Vlieger, <a href="/A292911/a292911.txt">Comparison of A292911 and A002144</a>
%F A292911 If the conjecture is true, then for n>=2, a(n) <= (A002144(n-1) + 1)/2 (the equality holds up to 90).
%t A292911 Select[Array[{2^IntegerExponent[2 #, 2] EulerE[2 # - 1, #], #} &, 330], Divisible[#1, (2 #2 - 1)^3] & @@ # &][[All, -1]] (* _Michael De Vlieger_, Sep 27 2017, after _Peter Luschny_ at A291897 *)
%Y A292911 Cf. A002144, A291897.
%K A292911 nonn
%O A292911 1,2
%A A292911 _Vladimir Shevelev_, Sep 26 2017
%E A292911 More terms from _Peter J. C. Moses_, Sep 26 2017