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.

A344282 Column 1 of A317721.

This page as a plain text file.
%I A344282 #5 May 24 2021 00:58:09
%S A344282 71,359,359,359,487,487,863,863,863,863,863,863,863,1069,1093,1093,
%T A344282 1483,1549,1549,1549,1549,1549,1549,2281,3511,3511,3511,3511,3511,
%U A344282 3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511,3511
%N A344282 Column 1 of A317721.
%C A344282 A297846 with each term repeated A317919(n) times.
%o A344282 (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 A344282 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 A344282 printfromvec(vec) = for(k=1, #vec, if(vec[k][1]==vec[k][#vec[k]], print1(vec[k][1], ", ")))
%o A344282 forprime(p=1, , my(v=[[p]]); while(#v > 0, v=addtovec(v); printfromvec(v); v=removefromvec(v)))
%Y A344282 Cf. A297846, A317721, A317919, A344283 (column 2).
%K A344282 nonn
%O A344282 1,1
%A A344282 _Felix Fröhlich_, May 14 2021