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!)
A343691 a(n) is the least prime p such that p + A014574(n) is prime. 1
3, 5, 5, 5, 7, 5, 7, 7, 5, 5, 11, 7, 11, 5, 13, 5, 11, 7, 11, 5, 5, 11, 7, 5, 19, 7, 7, 13, 5, 13, 11, 5, 11, 5, 5, 11, 7, 11, 7, 5, 11, 7, 5, 7, 5, 7, 5, 7, 5, 5, 5, 7, 29, 11, 11, 13, 5, 11, 17, 23, 5, 11, 5, 11, 17, 7, 11, 5, 5, 23, 7, 7, 7, 17, 5, 5, 7, 11, 7, 17, 29, 11, 17, 13, 5, 13, 7, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) >= 5 for n >= 2, since A014574(n) == 0 (mod 6).
a(n) = 5 if and only if A001359(n) is in A022004.
LINKS
EXAMPLE
a(5) = 7 because A014574(5) = 30 and 7 is the least prime p such that 30+p is prime.
MAPLE
P:= {seq(ithprime(i), i=1..10^4)}:
A014574:= sort(convert(map(`+`, P, 1) intersect map(`-`, P, 1), list)):
f:= proc(n) local p, t;
p:= 2;
do
p:= nextprime(p);
if isprime(p+A014574[n]) then return p fi
od
end proc:
map(f, [$1..nops(A014574)]);
CROSSREFS
Sequence in context: A338058 A365677 A335138 * A196604 A131506 A113722
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Apr 26 2021
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 21 06:38 EDT 2024. Contains 373540 sequences. (Running on oeis4.)