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.

A023148 Numbers k such that prime(k) == 6 (mod k).

This page as a plain text file.
%I A023148 #24 Feb 11 2021 22:53:54
%S A023148 1,5,79,445,16055,27067045,1208198549,1208198609,1208198615,
%T A023148 2636913002983,885992692751479,885992692751483,885992692751833,
%U A023148 43525513764815035,43525513764815057,43525513764815173,43525513764816367
%N A023148 Numbers k such that prime(k) == 6 (mod k).
%C A023148 a(18) > 2.8*10^20. - _Giovanni Resta_, Feb 23 2020
%t A023148 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 6, Print[n]], {n, 1, 10^9}] (* _Robert G. Wilson v_, Feb 18 2004 *)
%o A023148 (Sage)
%o A023148 def A023148(max) :
%o A023148     terms = []
%o A023148     p = 2
%o A023148     for n in range(1, max+1) :
%o A023148         if (p - 6) % n == 0 : terms.append(n)
%o A023148         p = next_prime(p)
%o A023148     return terms
%o A023148 # _Eric M. Schmidt_, Feb 05 2013
%Y A023148 Cf. A092048, A023143, A023144, A023145, A023146, A023147, A023149, A023150, A023151, A023152.
%K A023148 nonn,more
%O A023148 1,2
%A A023148 _David W. Wilson_
%E A023148 Extended by _Robert G. Wilson v_, Feb 18 2004
%E A023148 a(7)-a(9) from _Robert G. Wilson v_, Feb 22 2006
%E A023148 First two terms inserted by _Eric M. Schmidt_, Feb 05 2013
%E A023148 a(10)-a(17) from _Giovanni Resta_, Feb 23 2020