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.

A302767 Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11.

This page as a plain text file.
%I A302767 #15 Aug 10 2021 17:48:09
%S A302767 46,1365,2431,2821,3808,4241,4412,4626,4966,6737,7169,7782,8555,9597,
%T A302767 9948,10576,10696,11277,12025,12842,13037,13194,14465,16609,17340,
%U A302767 17594,19228,19382,20230,21338,22913,24800,25414,25457,25628,26084,26421,26489,26575
%N A302767 Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11.
%e A302767 [prime(46), prime(47), prime(48)] = [199, 211, 223] = [1,2,3] mod 11.
%t A302767 SequencePosition[Mod[Prime[Range[27000]],11],{1,2,3}][[All,1]] (* _Harvey P. Dale_, Aug 10 2021 *)
%K A302767 nonn
%O A302767 1,1
%A A302767 _Zak Seidov_, Apr 13 2018