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 A239727 #24 Mar 27 2014 04:48:47 %S A239727 1,4,12,19,59,92,159,227,256,514,706,1466,5207,21209,62809,86914, %T A239727 152351,170167,321472,424783,491702,860831,1415551,1581442,2679809, %U A239727 4691576,6238447,6630812,17886697,27507569,30581429,57868997,108830332,116156102,127813579,154641337,1072567492,1101795593,3546087418,10371779744 %N A239727 Numbers n such that the least prime of the form 2nk + 1 has a value of k that is larger than the k values for all smaller n. %C A239727 RECORDS transform of A016014. %C A239727 Sequence is infinite; a terrible upper bound can be derived from Linnik's theorem together with the Chinese Remainder Theorem, giving a(n) << exp(a(n-1)^6). %F A239727 A016014(a(n)) = A239746(n). - _Zak Seidov_, Mar 27 2014 %e A239727 2*4*2+1 = 17 is prime with k = 2, but 1 through 3 have k = 1. %e A239727 2*12*3+1 = 73 is prime with k = 3, but k = 2 for 4, 7, 10 and k = 1 for the other n < 12. %o A239727 (PARI) A016014(n)=my(k); while(!isprime(2*n*k+++1),);k %o A239727 r=0;for(n=1,1e8,t=A016014(n);if(t>r,r=t;print1(n", "))) %Y A239727 Cf. A016014, A239746. %K A239727 nonn %O A239727 1,2 %A A239727 _Charles R Greathouse IV_, Mar 25 2014 %E A239727 a(37)-a(40) from _Giovanni Resta_, Mar 26 2014