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.

A105290 Numbers k such that prime(k+1) == 4 (mod k).

This page as a plain text file.
%I A105290 #36 Jul 21 2024 00:28:14
%S A105290 1,3,11,13,69,71,637225,637253,637313,637327,4124459,4124685,27067033,
%T A105290 179993017,179993023,1208198853,8179002097,8179002109,55762149091
%N A105290 Numbers k such that prime(k+1) == 4 (mod k).
%C A105290 Integers k such that A004649(k+1) = 4. - _Michel Marcus_, Dec 30 2022
%o A105290 (PARI) my(n=0, p=2); while(n++, (-4+p=nextprime(p+1))%n || print1(n, ", ")) \\ _M. F. Hasler_, Feb 05 2009
%Y A105290 Cf. A023144, A092044.
%Y A105290 Cf. A004649, A105286, A105287, A105288, A105329, A105451.
%K A105290 nonn,more
%O A105290 1,2
%A A105290 _Zak Seidov_, Apr 25 2005
%E A105290 Missing first two terms inserted by _M. F. Hasler_, Feb 04 2009
%E A105290 a(11)-a(13) from _M. F. Hasler_, Feb 05 2009
%E A105290 a(14)-a(15) from _Sean A. Irvine_, Nov 25 2010
%E A105290 a(16) from _D. S. McNeil_, Nov 25 2010
%E A105290 a(17)-a(19) from _Charles R Greathouse IV_, May 05 2011