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.

A085346 Least number x so that number of primes between sigma(x) and phi(x) equals n.

This page as a plain text file.
%I A085346 #13 Dec 20 2024 02:37:27
%S A085346 3,2,4,6,10,14,12,26,18,34,28,32,24,62,44,30,123,40,36,64,56,106,54,
%T A085346 48,70,66,146,105,88,78,80,135,60,178,72,102,202,112,84,164,114,90,96,
%U A085346 154,695,231,138,108,184,1141,176,140,126,244,132,160,326,232,186,208,120
%N A085346 Least number x so that number of primes between sigma(x) and phi(x) equals n.
%H A085346 Amiram Eldar, <a href="/A085346/b085346.txt">Table of n, a(n) for n = 1..10000</a>
%F A085346 a(n) = Min{x; A085343(x) = n}.
%o A085346 (PARI) s(n) = my(f = factor(n)); primepi(sigma(f)) - primepi(eulerphi(f));
%o A085346 list(len) = {my(v = vector(len), k = 1, c = 0, i); while(c < len, i = s(k); if(i > 0 && i <= len && v[i] == 0, c++; v[i] = k); k++); v;} \\ _Amiram Eldar_, Dec 20 2024
%Y A085346 Cf. A000720, A000010, A000203, A070803, A070804, A085341-A085347.
%K A085346 nonn
%O A085346 1,1
%A A085346 _Labos Elemer_, Jul 10 2003