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.

A066942 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 6.

This page as a plain text file.
%I A066942 #18 Dec 10 2024 11:13:26
%S A066942 9,15,16,23,32,39,40,51,54,55,56,71,76,86,96,97,102,103,107,108,118,
%T A066942 119,123,139,160,161,164,165,170,184,185,194,195,199,200,208,218,219,
%U A066942 227,238,245,252,255,267,290,291,292,293,298,311,312,329,342,345,349
%N A066942 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 6.
%C A066942 Numbers k such that A063086(k) = 6. - _Andrew Howroyd_, Dec 10 2024
%H A066942 Harry J. Smith, <a href="/A066942/b066942.txt">Table of n, a(n) for n = 1..1000</a>
%t A066942 Select[ Range[400], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 6 & ]
%t A066942 Drop[Position[Partition[Prime[Range[400]],2,1],_?(GCD@@(#+1)==6&)],2]//Flatten (* _Harvey P. Dale_, Nov 08 2022 *)
%o A066942 (PARI) isok(k) = { gcd(prime(k+1) + 1, prime(k) + 1) == 6 } \\ _Harry J. Smith_, Apr 10 2010
%Y A066942 Cf. A063086, A066940, A066941, A066943, A066944, A067603, A067604.
%K A066942 nonn
%O A066942 1,1
%A A066942 _Benoit Cloitre_, Jan 24 2002
%E A066942 Edited by _Robert G. Wilson v_, Feb 01 2002