cp's OEIS Frontend

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.

A074884 For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.

This page as a plain text file.
%I A074884 #20 Apr 18 2019 05:12:18
%S A074884 2,7,17,19,59,167,197,227,317,457,521,1637,1861,1997,2053,3833,5227,
%T A074884 19891,47303,54973,58603,124567,138163,170167,707467,1637429,1940777,
%U A074884 3717731,4722079,17886697,27507569,73342163,154205101,160561133,186668543,429364379,458121431,1459411661,2140833967,4028983027,5189517859,6184586189,10352323829,36673176307
%N A074884 For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.
%e A074884 a(1)=2 because k(2)=1 (2*1*2+1=5 is prime);
%e A074884 a(2)=7 because k(7)=2 (2*1*7+1=15 is not prime, 2*2*7+1=29 is prime).
%Y A074884 Cf. A117673.
%K A074884 nonn
%O A074884 1,1
%A A074884 _Mike Oakes_, Oct 01 2002
%E A074884 a(30)-a(38) from _Don Reble_, Jan 07 2013
%E A074884 a(39)-a(44) from _Marco Frigerio_, Mar 25 2019