login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A270535 Integers n such that A001359(n) + A001359(n+3) = A001359(n+1) + A001359(n+2). 1
5, 8, 10, 11, 15, 16, 17, 27, 36, 68, 69, 71, 111, 132, 189, 200, 212, 214, 234, 252, 262, 279, 317, 332, 343, 344, 364, 424, 426, 500, 506, 518, 520, 543, 563, 577, 606, 620, 658, 672, 696, 697, 737, 766, 882, 907, 982, 1009, 1064, 1087, 1089, 1091, 1162, 1164, 1172, 1226, 1256, 1268 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Integers n such that A006512(n) + A006512(n+3) = A006512(n+1) + A006512(n+2).

Integers n such that A014574(n) + A014574(n+3) = A014574(n+1) + A014574(n+2).

LINKS

Table of n, a(n) for n=1..58.

EXAMPLE

5 is a term because A001359(5) = 29, A001359(6) = 41, A001359(7) = 59, A001359(8) = 71 and 29 + 71 = 41 + 59.

MATHEMATICA

s = Select[Prime@ Range[10^6], PrimeQ[# + 2] &]; Select[Range@ 1300, s[[#]] + s[[# + 3]] == s[[# + 1]] + s[[# + 2]] &] (* after Robert G. Wilson v at A001359 *)

PROG

(PARI) t(n, p=3) = { while( p+2 < (p=nextprime( p+1 )) || n-->0, ); p-2}

b(n) = t(n) + t(n+3) - t(n+1) - t(n+2);

for(n=1, 2000, if(b(n) == 0, print1(n, ", ")));

CROSSREFS

Cf. A001359, A006512, A014574, A053319.

Sequence in context: A121901 A024707 A156288 * A287110 A194425 A314376

Adjacent sequences:  A270532 A270533 A270534 * A270536 A270537 A270538

KEYWORD

nonn

AUTHOR

Altug Alkan, Mar 18 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 03:30 EST 2020. Contains 332299 sequences. (Running on oeis4.)