login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317920 Length of row n of A317721, i.e., number of elements in n-th Wieferich tuple when ordering the tuples as in A317721. 8

%I #10 Sep 07 2018 04:07:19

%S 3,5,6,7,6,7,3,8,9,9,10,10,11,9,2,3,6,9,10,11,12,13,14,3,3,4,4,5,5,5,

%T 5,5,6,6,7,7,7,7,7,7,7,7,8,8,9,9,9,9,10,10,10,10,10,10,10,10,10,10,11,

%U 11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12

%N Length of row n of A317721, i.e., number of elements in n-th Wieferich tuple when ordering the tuples as in A317721.

%e For n = 1: Row 1 of A317721 has 3 elements, i.e., the first Wieferich tuple listed in A317721 is a "Wieferich triple", so a(1) = 3.

%o (PARI) addtovec(vec) = my(w=[], vmax=0); for(t=1, #vec, if(vecmax(vec[t]) > vmax, vmax=vecmax(vec[t]))); for(k=1, #vec, forprime(q=1, vmax, if(Mod(vec[k][#vec[k]], q^2)^(q-1)==1, w=concat(w, [0]); w[#w]=concat(vec[k], [q])))); w

%o removefromvec(vec) = my(w=[]); for(k=1, #vec, if(vecsort(vec[k])==vecsort(vec[k], , 8), w=concat(w, [0]); w[#w]=vec[k])); w

%o printfromvec(vec) = for(k=1, #vec, if(vec[k][1]==vec[k][#vec[k]], print1(#vec[k]-1, ", ")))

%o forprime(p=1, , my(v=[[p]]); while(#v > 0, v=addtovec(v); printfromvec(v); v=removefromvec(v)))

%Y Cf. A297846, A317721, A317919.

%K nonn

%O 1,1

%A _Felix Fröhlich_, Aug 21 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 14 10:28 EDT 2024. Contains 375921 sequences. (Running on oeis4.)