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.

A098764 a(n) = 3p - q where p and q are consecutive primes.

This page as a plain text file.
%I A098764 #27 Feb 19 2024 03:42:04
%S A098764 3,4,8,10,20,22,32,34,40,56,56,70,80,82,88,100,116,116,130,140,140,
%T A098764 154,160,170,190,200,202,212,214,212,250,256,272,268,296,296,308,322,
%U A098764 328,340,356,352,380,382,392,386,410,442,452,454,460,476,472,496,508,520
%N A098764 a(n) = 3p - q where p and q are consecutive primes.
%C A098764 Except for the initial term, a(n)=={2, 4} mod 6.
%C A098764 Not monotonic: a(29) = 214 > 212 = a(30), a(33) = 272 > 268 = a(34), etc. - _Charles R Greathouse IV_, Jun 03 2013
%H A098764 Paolo Xausa, <a href="/A098764/b098764.txt">Table of n, a(n) for n = 1..10000</a>
%F A098764 a(n) = A001043(n) - 2*A001223(n).
%F A098764 a(n) = 3*A000040(n)-A000040(n+1) = A001748(n)-A000040(n+1) = A001747(n+1)-A001223(n). - _R. J. Mathar_, Apr 22 2010
%F A098764 a(n) ~ 2n log n. - _Charles R Greathouse IV_, Jun 03 2013
%F A098764 a(n) = A100021(n) + 3. - _Hugo Pfoertner_, Nov 02 2023
%F A098764 a(n) = A062234(n) + A000040(n). - _Anthony S. Wright_, Feb 19 2024
%t A098764 ListConvolve[{-1,3},Prime[Range[100]]] (* _Paolo Xausa_, Nov 02 2023 *)
%o A098764 (PARI) a(n) = 3*prime(n) - prime(n+1) \\ _Michel Marcus_, Jun 03 2013
%Y A098764 Cf. A000040, A001043, A001223, A001748, A047235, A100021.
%K A098764 nonn,easy
%O A098764 1,1
%A A098764 _Giovanni Teofilatto_, Sep 30 2004
%E A098764 Corrected (116 duplicated) by _R. J. Mathar_, Apr 22 2010