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.
A[1]:= 4: t:= 4: count:= 1:
for x from 5 while count < 100 do
if igcd(x, t) = 1 then
if numtheory:-bigomega(x)=2 then
count:= count+1;
A[count]:= x;
t:= x;
fi
fi
od:
seq(A[i], i=1..100); # Robert Israel, Jun 11 2023
lista(nn) = {my(vsp = select((x->(bigomega(x) == 2)), vector(nn, k, k)), i = 1, last); while (i <= #vsp, print1(vsp[i], ", "); last = vsp[i]; while(gcd(vsp[i], last) != 1, i++; if (i>#vsp, break)););} \\ Michel Marcus, Jun 25 2019
A107622[n_]:= Prime[n] + (3 - Mod[n, 2]) (* From Zak Seidov *) Total[#]&/@Partition[Riffle[Prime[Range[100]],{2,3}],2] (* Harvey P. Dale, Dec 14 2010 *)
A107623[n_]:= Prime[n] + (2 + Mod[n, 2])
Comments