The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114232 n(k) is the minimum number of n that need at least another number of k to make Prime[n]+2*Prime[n-k]a prime. 4
2, 10, 5, 14, 22, 35, 41, 26, 17, 92, 170, 79, 190, 43, 164, 240, 175, 590, 94, 236, 446, 1004, 279, 920, 409, 971, 646, 1088, 502, 449, 1219, 1263, 2049, 1541, 2191, 915, 3727, 1886, 1394, 4506, 5014, 1524, 1181, 6323, 888, 3995, 4033, 6625, 9664, 13733 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Shows the first 204 items; Sequenced defined for all k>=1; Sequence the first appearance of k in A114231
LINKS
EXAMPLE
k=1: Prime[2]+2*Prime[2-1]=3+2*2=7 is prime, so n(1)=2;
k=2: Prime[10]+2*Prime[10-2]=29+2*19=67 is prime, so n(2)=10;
while
Prime[3]+2*Prime[3-1]=5+2*3=11 is prime, not count according to the definition
MATHEMATICA
Do[n[k] = 0, {k, 1, 2000}]; ct = 0; nm = 0; n2 = 0; n1 = 2; p1 = 3; While[ct < 200, n2 = 1; p2 = Prime[n1 - n2]; While[cp = p1 + 2*p2; ! PrimeQ[cp], n2++; p2 = Prime[n1 - n2]]; If[n[n2] == 0, n[ n2] = n1; If[n2 > nm, nm = n2]; If[n2 <= 200, ct++ ]; Print[Table[n[k], {k, 1, nm}]]]; n1++; p1 = Prime[n1]];
CROSSREFS
Sequence in context: A234041 A027626 A096668 * A070730 A082192 A276850
KEYWORD
nonn
AUTHOR
Lei Zhou, Nov 20 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 08:22 EDT 2024. Contains 373329 sequences. (Running on oeis4.)