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.

Original entry on oeis.org

1, 2, 3, 4, 48, 84, 85, 119, 181, 211, 212, 213, 270, 296, 297, 326, 352, 353, 354, 378, 483, 484, 485, 513, 514, 539, 566, 591, 641, 665, 666, 691, 713, 739, 766, 790, 815, 816, 841, 864, 865, 890, 914, 936, 937, 960, 1007, 1029, 1054, 1055, 1076, 1077, 1104, 1105, 1151
Offset: 1

Views

Author

Zak Seidov, Apr 26 2015

Keywords

Comments

Numbers n such that A039706(n)= A242125(n).
8 and 27 are first two cubes > 1.

Examples

			prime(48) = 223 = 7 (mod 8) == 7 mod(27).
		

Crossrefs

Programs

  • Magma
    [n: n in [1..1500] | NthPrime(n) mod 8 eq NthPrime(n) mod 27]; // Vincenzo Librandi, Apr 28 2015
    
  • Mathematica
    Select[Range@ 1000, Mod[Prime@ #, 8] == Mod[Prime@ #, 27] &] (* Michael De Vlieger, Apr 27 2015 *)
  • PARI
    isok(n) = (prime(n) % 8) == (prime(n) % 27); \\ Michel Marcus, May 08 2017

Formula

a(n) = A000720(A257483(n)).

Extensions

More terms from Vincenzo Librandi, Apr 28 2015