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.

Showing 1-1 of 1 results.

A344282 Column 1 of A317721.

Original entry on oeis.org

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
Offset: 1

Views

Author

Felix Fröhlich, May 14 2021

Keywords

Comments

A297846 with each term repeated A317919(n) times.

Crossrefs

Cf. A297846, A317721, A317919, A344283 (column 2).

Programs

  • 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)))
Showing 1-1 of 1 results.