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 A184867 #8 Jan 30 2018 09:47:58 %S A184867 2,4,5,6,7,9,11,12,13,15,17,18,20,22,23,24,27,28,29,30,31,33,34,36,37, %T A184867 38,39,40,42,43,45,46,47,48,50,51,52,55,56,57,59,60,61,62,63,64,65,66, %U A184867 67,68,70,72,74,75,76,77,78,80,81,82,83,84,86,88,89,91,92,94,95,96,97,99,101,102,103,104,105,106,107,108,110,111,113,114,115,116,117,119,120,122,123,124,126,127,129,130,133,134,135,136,140,143,144,145,146 %N A184867 Numbers m such that prime(m) is of the form floor(1/2+k*sqrt(2)). Complement of A184870. %H A184867 G. C. Greubel, <a href="/A184867/b184867.txt">Table of n, a(n) for n = 1..10000</a> %t A184867 r=2^(1/2); h=1/2; a[n_]:=Floor[n*r+h]; %t A184867 Table[a[n], {n, 1, 120}] (* A022846, int. nearest 2^(1/2) *) %t A184867 t1={}; Do[If[PrimeQ[a[n]], AppendTo[t1, a[n]]], {n, 1, 600}]; t1 %t A184867 t2={}; Do[If[PrimeQ[a[n]], AppendTo[t2, n]], {n, 1, 600}]; t2 %t A184867 t3={}; Do[If[MemberQ[t1, Prime[n]], AppendTo[t3, n]], {n, 1, 300}]; t3 %t A184867 (* Lists t1, t2, t3 match A184865, A184866, A184867. *) %Y A184867 Cf. A022846, A184865, A184866, A184870. %K A184867 nonn %O A184867 1,1 %A A184867 _Clark Kimberling_, Jan 23 2011