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!)
A260265 Numbers n such that prime(n) + prime(n+4) + prime(n+5) + prime(n+7) + prime(n+8) = prime(n+1) + prime(n+2) + prime(n+3) + prime(n+6) + prime(n+9). 1

%I #10 Sep 08 2022 08:46:13

%S 180,205,223,258,297,326,350,424,502,514,521,548,666,757,765,796,804,

%T 861,909,1006,1098,1150,1264,1317,1348,1349,1400,1416,1592,1613,1663,

%U 1757,1821,1914,1939,2034,2048,2073,2085,2109,2164,2276,2316,2360,2380,2398,2655

%N Numbers n such that prime(n) + prime(n+4) + prime(n+5) + prime(n+7) + prime(n+8) = prime(n+1) + prime(n+2) + prime(n+3) + prime(n+6) + prime(n+9).

%H K. D. Bajpai, <a href="/A260265/b260265.txt">Table of n, a(n) for n = 1..10000</a>

%e 180 is in the list because 1069 + 1097 + 1103 + 1117 + 1123 = 1087 + 1091 + 1093 + 1109 + 1129.

%t Select[Range[5000], Prime[#] + Prime[# + 4] + Prime[# + 5] + Prime[# + 7] + Prime[# + 8] == Prime[# + 1] + Prime[# + 2] + Prime[# + 3] + Prime[# + 6] + Prime[# + 9] &]

%o (PARI) for(n=1,5000, if(prime(n) + prime(n+4) + prime(n+5) + prime(n+7) + prime(n+8) == prime(n+1) + prime(n+2) + prime(n+3) + prime(n+6) + prime(n+9), print1(n,", ")));

%o (Magma) [n: n in [1..3000] | NthPrime(n) + NthPrime(n+4)+ NthPrime(n+5)+ NthPrime(n+7)+ NthPrime(n+8) eq NthPrime(n+1)+ NthPrime(n+2)+ NthPrime(n+3)+ NthPrime(n+6)+ NthPrime(n+9)];

%Y Cf. A000040, A022885, A260179.

%K nonn

%O 1,1

%A _K. D. Bajpai_, Jul 21 2015

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 May 4 13:19 EDT 2024. Contains 372243 sequences. (Running on oeis4.)