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.

A189125 Primes p such that A005245(p) < A005245(p-1)+1.

This page as a plain text file.
%I A189125 #12 Aug 11 2014 22:45:46
%S A189125 353942783,1163385647,1932319583,2336924879,4166809919,4937621453,
%T A189125 5123340683,5184740299,5390865059,5455982879,5467766947,6432033887,
%U A189125 6459553799,6545574839,6714582263,6988649399,7378517519,7515851039,7657182539,7756383347
%N A189125 Primes p such that A005245(p) < A005245(p-1)+1.
%C A189125 Counterexamples to the conjecture from section F26 in UPINT.
%C A189125 a(1) was found by _Martin Fuller_; a(2) was found by Janis Iraids.
%C A189125 The prime terms of each of the sequences A189123 and A189124.
%D A189125 R. K. Guy, Unsolved Problems in Number Theory, Section F26.
%H A189125 Janis Iraids, <a href="/A189125/b189125.txt">Table of n, a(n) for n = 1..1000</a>
%H A189125 Martin N. Fuller, <a href="/A005245/a005245.c.txt">C program for A005245</a>
%Y A189125 Cf. A005245, A189123, A189124.
%K A189125 nonn,hard
%O A189125 1,1
%A A189125 _Max Alekseyev_, Apr 17 2011
%E A189125 More terms from _Janis Iraids_, Apr 20 2011.