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.

A084739 Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.

This page as a plain text file.
%I A084739 #21 Aug 04 2018 02:52:31
%S A084739 3,7,23,41,109,457,311,191,2137,409,1021,1031,1811,271,14293,2791,
%T A084739 55441,35911,57991,221101,23911,11971,110881,103091,71761,513991,
%U A084739 290041,31771,448141,2447761,674701,3248701,2831011,690541,190321,2080597,4076641
%N A084739 Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.
%C A084739 Smallest prime(m) such that A002233(m) = prime(n). (Corrected by _Jonathan Sondow_, Feb 02 2013)
%H A084739 N. J. A. Sloane, <a href="/A084739/b084739.txt">Table of n, a(n) for n=1..97</a> (from the web page of Tomás Oliveira e Silva)
%H A084739 Tomás Oliveira e Silva, <a href="http://sweet.ua.pt/tos/p_roots.html">Least primitive root of prime numbers</a>
%H A084739 A. Paszkiewicz and A. Schinzel, <a href="https://doi.org/10.1090/S0025-5718-02-01370-4">On the least prime primitive root modulo a prime</a>, Math. Comp. 71 (2002), no. 239, 1307-1321.
%Y A084739 Cf. A084735, A001918, A079061. For records see A133434.
%K A084739 nonn,easy
%O A084739 1,1
%A A084739 _N. J. A. Sloane_, Jul 03 2003
%E A084739 More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and _Don Reble_, Jul 03 2003