cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A375097 a(n) = prime(n+2) - (prime(n) + prime(n+1))/2.

This page as a plain text file.
%I A375097 #13 Jul 30 2024 09:13:25
%S A375097 3,5,4,5,4,5,8,5,7,7,4,5,8,9,5,7,7,4,7,7,8,11,8,4,5,4,5,16,11,8,5,11,
%T A375097 7,7,9,7,8,9,5,11,7,5,4,13,18,10,4,5,8,5,11,11,9,9,5,7,7,4,11,19,11,4,
%U A375097 5,16,13,13,7,5,8,11,10,9,7,8,11,8,10,14,7,11
%N A375097 a(n) = prime(n+2) - (prime(n) + prime(n+1))/2.
%H A375097 Michael De Vlieger, <a href="/A375097/b375097.txt">Table of n, a(n) for n = 2..10000</a>
%t A375097 Array[#3 - (#1 + #2)/2 & @@ Prime[{#, # + 1, # + 2}] &, 80, 2] (* _Michael De Vlieger_, Jul 30 2024 *)
%o A375097 (PARI) a(n) = prime(n+2) - (prime(n) + prime(n+1))/2
%Y A375097 Cf. A024675, A096379, A191472, A305748, A364411.
%K A375097 nonn,easy
%O A375097 2,1
%A A375097 _Hugo Pfoertner_, Jul 30 2024