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 A184870 #8 Jan 30 2018 09:58:40 %S A184870 1,3,8,10,14,16,19,21,25,26,32,35,41,44,49,53,54,58,69,71,73,79,85,87, %T A184870 90,93,98,100,109,112,118,121,125,128,131,132,137,138,139,141,142,149, %U A184870 153,159,160,161,164,169,171,174,181,182,192,196,199,202,207,209,213,218,219,221,226,228,231,235,236,240,242,246,249,255,258,259,266,267,270,273,275,277,279,280,287,292,294,297,299,303 %N A184870 Numbers m such that prime(m) is of the form floor[(k-1/2)*(2+2^(1/2))+1/2]; complement of A184867. %H A184870 G. C. Greubel, <a href="/A184870/b184870.txt">Table of n, a(n) for n = 1..10000</a> %t A184870 a[n_]:=Floor[(n-1/2)*(2+2^(1/2))+1/2]; %t A184870 Table[a[n],{n,1,120}] (* A063957 *) %t A184870 t1={}; Do[If[PrimeQ[a[n]], AppendTo[t1,a[n]]],{n,1,600}];t1 %t A184870 t2={}; Do[If[PrimeQ[a[n]], AppendTo[t2,n]],{n,1,600}];t2 %t A184870 t3={}; Do[If[MemberQ[t1,Prime[n]],AppendTo[t3,n]],{n,1,400}];t3 %t A184870 (* Lists t1, t2, t3 match A184868, A184869, A184870. *) %Y A184870 Cf. A063957, A184868, A184869. %K A184870 nonn %O A184870 1,2 %A A184870 _Clark Kimberling_, Jan 23 2011