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.

A125647 Smallest odd prime base q such that p^6 divides q^(p-1) - 1, where p = Prime[n].

This page as a plain text file.
%I A125647 #10 Mar 20 2025 22:33:53
%S A125647 193,1459,14557,152617,2120879,7654109,24527681,2342959,90603883,
%T A125647 1657641497,40373093,2175429661,1614357949,119612113,14635471219,
%U A125647 2816276179,15591204869,1006953931,7726467079,48931161299,54908441659,41985419521,583493688221,200335697059,96891225583,50303508131,129847013561,362253784469,625810253147,195406393583
%N A125647 Smallest odd prime base q such that p^6 divides q^(p-1) - 1, where p = Prime[n].
%H A125647 W. Keller and J. Richstein <a href="http://www1.uni-hamburg.de/RRZ/W.Keller/FermatQuotient.html">Fermat quotients that are divisible by p</a>.
%o A125647 (PARI) { a(n) = local(p,x,y); if(n==1,return(193)); p=prime(n); x=znprimroot(p^6)^(p^5); vecsort( vector(p-1,i, y=lift(x^i);while(!isprime(y),y+=p^6);y ) )[1] } \\ _Max Alekseyev_, May 30 2007
%Y A125647 Cf. A125609, A125610, A125611, A125612, A125632, A125633, A125634, A125635, A125636, A125637, A125645, A125646, A125648, A125649.
%K A125647 nonn
%O A125647 1,1
%A A125647 _Alexander Adamchuk_, Nov 29 2006
%E A125647 More terms from _Max Alekseyev_, May 30 2007