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.

A212378 Primes congruent to 1 mod 61.

This page as a plain text file.
%I A212378 #12 Sep 08 2022 08:46:02
%S A212378 367,733,977,1709,1831,2441,3539,4027,4271,4637,4759,5003,5857,6101,
%T A212378 6833,7321,7687,8053,8297,8419,8663,9029,9151,9883,10859,12323,12689,
%U A212378 13177,13421,14153,14519,15373,15739,16349,17203,17569,18301,18911,21107,21839,21961
%N A212378 Primes congruent to 1 mod 61.
%C A212378 Coincides for the first 58 terms with A059230, that is the sequence of primes p such that x^61 = 2 has no solution mod p (first divergence is at 34039).
%H A212378 Bruno Berselli, <a href="/A212378/b212378.txt">Table of n, a(n) for n = 1..1000</a>
%F A212378 a(n) ~ 60n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t A212378 Select[Prime[Range[2500]], Mod[#, 61] == 1 &]
%t A212378 Select[Range[1, 22000, 61], PrimeQ]
%o A212378 (Magma) [p: p in PrimesUpTo(22000) | IsOne(p mod 61)];
%o A212378 (PARI) is(n)=isprime(n) && n%61==1 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A212378 Cf. A000040, A059230, A142800-A142858.
%K A212378 nonn,easy
%O A212378 1,1
%A A212378 _Bruno Berselli_, Sep 20 2012