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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A344282 Column 1 of A317721. 1
 71, 359, 359, 359, 487, 487, 863, 863, 863, 863, 863, 863, 863, 1069, 1093, 1093, 1483, 1549, 1549, 1549, 1549, 1549, 1549, 2281, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511, 3511 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A297846 with each term repeated A317919(n) times. LINKS PROG (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 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 printfromvec(vec) = for(k=1, #vec, if(vec[k][1]==vec[k][#vec[k]], print1(vec[k][1], ", "))) forprime(p=1, , my(v=[[p]]); while(#v > 0, v=addtovec(v); printfromvec(v); v=removefromvec(v))) CROSSREFS Cf. A297846, A317721, A317919, A344283 (column 2). Sequence in context: A343913 A142375 A215470 * A297846 A142304 A201313 Adjacent sequences: A344279 A344280 A344281 * A344283 A344284 A344285 KEYWORD nonn AUTHOR Felix Fröhlich, May 14 2021 STATUS approved

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.

Last modified December 8 22:05 EST 2022. Contains 358698 sequences. (Running on oeis4.)