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 A186945 #12 Sep 07 2013 14:33:08 %S A186945 2,3,5,13,17,25,31,49,61,71,73,81,103,109,113,131,139,157,173,181,191, %T A186945 193,199,239,241,257,269,271,283,289,293,313,353,361,373,379,409,419, %U A186945 421,433,439,443,463,491,499,509,571,577,599,601,607,613,619,643,647 %N A186945 The smallest integer x > 0 such that the number of terms of A050376 in (x/2,x] equals n. %C A186945 The sequence is an analog of Labos primes (A080359) in Fermi-Dirac arithmetic, since in this arithmetic terms of A050376 play role of primes (see comments in A050376). %H A186945 Peter J. C. Moses, <a href="/A186945/b186945.txt">Table of n, a(n) for n = 1..10000</a> %F A186945 a(n) <= A228520(n). %Y A186945 Cf. A080359, A228520, A228592. %K A186945 nonn %O A186945 1,1 %A A186945 _Vladimir Shevelev_, Aug 30 2013 %E A186945 More terms from _Peter J. C. Moses_