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.

A066943 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 8.

This page as a plain text file.
%I A066943 #17 Dec 10 2024 11:13:35
%S A066943 72,92,128,132,156,166,228,246,281,282,386,417,507,519,619,620,640,
%T A066943 641,661,712,738,739,759,801,853,898,915,1000,1077,1152,1241,1246,
%U A066943 1273,1289,1297,1364,1389,1421,1489,1493,1525,1543,1564,1632,1691,1699,1729
%N A066943 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 8.
%C A066943 Numbers k such that A063086(k) = 8. - _Andrew Howroyd_, Dec 10 2024
%H A066943 Harry J. Smith, <a href="/A066943/b066943.txt">Table of n, a(n) for n = 1..1000</a>
%t A066943 Select[ Range[120], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 8 & ]
%o A066943 (PARI) isok(k) = { gcd(prime(k+1) + 1, prime(k) + 1) == 8 } \\ _Harry J. Smith_, Apr 10 2010
%Y A066943 Cf. A063086, A066940, A066941, A066942, A066944, A067603, A067604.
%K A066943 nonn
%O A066943 1,1
%A A066943 _Benoit Cloitre_, Jan 24 2002
%E A066943 Edited by _Robert G. Wilson v_, Feb 01 2002