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.

A066941 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 4.

This page as a plain text file.
%I A066941 #17 Dec 10 2024 11:13:39
%S A066941 4,8,14,19,22,27,31,38,46,47,48,63,75,85,90,93,94,95,114,117,124,131,
%T A066941 143,149,153,154,155,163,181,192,207,213,224,229,232,235,241,242,247,
%U A066941 248,249,261,276,285,299,303,304,314,327,328,333,334,335,348,364,370
%N A066941 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 4.
%C A066941 Numbers k such that A063086(k) = 4. - _Andrew Howroyd_, Dec 10 2024
%H A066941 Harry J. Smith, <a href="/A066941/b066941.txt">Table of n, a(n) for n = 1..1000</a>
%t A066941 Select[ Range[400], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 4 & ]
%o A066941 (PARI) isok(k) = { gcd(prime(k+1) + 1, prime(k) + 1) == 4 } \\ _Harry J. Smith_, Apr 10 2010
%Y A066941 Cf. A063086, A066940, A066942, A066943, A066944, A067603, A067604.
%K A066941 nonn
%O A066941 1,1
%A A066941 _Benoit Cloitre_, Jan 24 2002
%E A066941 Edited by _Robert G. Wilson v_, Feb 01 2002