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.

A257482 Numbers m such that prime(m) mod 8 == prime(m) mod 27.

This page as a plain text file.
%I A257482 #20 Sep 08 2022 08:46:12
%S A257482 1,2,3,4,48,84,85,119,181,211,212,213,270,296,297,326,352,353,354,378,
%T A257482 483,484,485,513,514,539,566,591,641,665,666,691,713,739,766,790,815,
%U A257482 816,841,864,865,890,914,936,937,960,1007,1029,1054,1055,1076,1077,1104,1105,1151
%N A257482 Numbers m such that prime(m) mod 8 == prime(m) mod 27.
%C A257482 Numbers n such that A039706(n)= A242125(n).
%C A257482 8 and 27 are first two cubes > 1.
%H A257482 Ivan Neretin, <a href="/A257482/b257482.txt">Table of n, a(n) for n = 1..10000</a>
%F A257482 a(n) = A000720(A257483(n)).
%e A257482 prime(48) = 223 = 7 (mod 8) == 7 mod(27).
%t A257482 Select[Range@ 1000, Mod[Prime@ #, 8] == Mod[Prime@ #, 27] &] (* _Michael De Vlieger_, Apr 27 2015 *)
%o A257482 (Magma) [n: n in [1..1500] | NthPrime(n) mod 8 eq NthPrime(n) mod 27]; // _Vincenzo Librandi_, Apr 28 2015
%o A257482 (PARI) isok(n) = (prime(n) % 8) == (prime(n) % 27); \\ _Michel Marcus_, May 08 2017
%Y A257482 Cf. A000720, A039706, A242125.
%K A257482 nonn
%O A257482 1,2
%A A257482 _Zak Seidov_, Apr 26 2015
%E A257482 More terms from _Vincenzo Librandi_, Apr 28 2015