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!)
A142341 Primes of the form (p(n)+r(n))/11, where p(n)=n-th prime and r(n)=n-th nonprime. 1
2, 5, 7, 17, 23, 59, 61, 83, 131, 137, 157, 241, 257, 293, 367, 467, 479, 557, 569, 571, 587, 787, 823, 853, 859, 971, 1093, 1217, 1499, 1523, 1553, 1559, 1571, 1579, 1699, 1733, 1789, 1831, 1847, 1907, 1999, 2011, 2081, 2113, 2129, 2239, 2293, 2393, 2423 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
If n=6, then (p(6)+r(6))/11=(13+9)/11=2=a(1).
If n=12, then (p(12)+r(12))/11=(37+18)/11=5=a(2).
If n=16, then (p(16)+r(16))/11=(53+24)/11=7=a(3).
If n=34, then (p(34)+r(34))/11=(139+48)/11=17=a(4).
If n=44, then (p(44)+r(44))/11=(193+60)/11=23=a(5), etc.
MAPLE
A141468 := proc(n) option remember ; if n = 1 then 0; else for a from procname(n-1)+1 do if not isprime(a) then RETURN(a) ; fi; od: fi: end: A000040 := proc(n) ithprime(n) ; end: for n from 1 to 6000 do c := A000040(n)+A141468(n) ; if c mod 11 = 0 then if isprime(c/11) then printf("%d, ", c/11) ; fi; fi; od: # R. J. Mathar, Nov 03 2008
MATHEMATICA
Module[{nn=50000, pr, np, len}, pr=Select[Range[nn], PrimeQ]; np=Complement[ Range[0, nn], pr]; len=Min[Length[pr], Length[np]]; Select[Total[#]/11&/@ Thread[ {Take[pr, len], Take[np, len]}], PrimeQ]] (* Harvey P. Dale, Jun 27 2020 *)
CROSSREFS
Sequence in context: A307452 A066028 A066039 * A318731 A256062 A303677
KEYWORD
nonn
AUTHOR
EXTENSIONS
3 replaced by 5, 241 and 257 inserted and extended by R. J. Mathar, Nov 03 2008
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 6 06:26 EDT 2024. Contains 373115 sequences. (Running on oeis4.)