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.

A048868 Numbers whose reduced residue system contains more primes than nonprimes.

This page as a plain text file.
%I A048868 #21 Dec 26 2024 23:17:00
%S A048868 8,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,
%T A048868 56,60,62,64,66,68,70,72,74,76,78,80,84,88,90,96,98,100,102,104,108,
%U A048868 110,112,114,120,126,130,132,138,140,144,150,154,156,160,162,168,170
%N A048868 Numbers whose reduced residue system contains more primes than nonprimes.
%C A048868 From _Michael De Vlieger_, May 21 2017: (Start)
%C A048868 Conjecture: all terms are even.
%C A048868 Let b(n) = differences of a(n). Many of the terms in b(n) are in A060735(n), i.e., b(n) >= A002110(n) and divisible by A002110(n). The smallest b(n) that is not in A060735 is b(450) = 66; b(450) > A002110(n) but not divisible by it; instead it is divisible by A002110(n-1). b(n) seems to "prefer" values of A002110(n) as n increases. There is a run of 22 values of 2 starting at b(2), of 22 values of 6 starting at b(178), of 7 values of 210 starting at b(543), and 3 values of 2310 starting at b(577). In the case of A002110(n) with n < 3, the length of runs of A002110(n) is greater than that of runs of any other number of comparable magnitude. The last observed position of A002110(n) in b(n) is {201, 442, (557), ...}.
%C A048868 Questions: are there increasingly more terms such that b(n) is not in A060735 as n increases? Are terms such that b(n) is in A060735 prevalent? Why does b(n) seem to "prefer" values in A002110 at certain magnitudes of n as n increases? Are there differences of a(n) = A002110(k) at positions greater than those observed, and if not, why? (End)
%H A048868 Michael De Vlieger, <a href="/A048868/b048868.txt">Table of n, a(n) for n = 1..586</a> (a(n) < 10^5, no more terms < 10^8 checked by David A. Corneth).
%H A048868 Michael De Vlieger, <a href="/A048868/a048868.txt">Values of a(n), their differences, and multiplicity notation of their differences</a>.
%H A048868 Wikipedia, <a href="http://en.wikipedia.org/wiki/Reduced_residue_system">Reduced residue system</a>.
%e A048868 n=30 is the largest extremal example whose reduced residue system consists only of primes and 1 (see A048597); n=8 Phi(8)=4, reduced residue system (8)={1,3,5,7} n=32 Phi(32)=16, reduced residue system (32)={1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31} of which only {1,9,15,21,25,27} are not primes, 10 are primes: 10 > 6 thus 32 belongs here.
%t A048868 Select[Range@ 170, Function[n, Count[Range@ n, _?(PrimeQ@ # && CoprimeQ[n, #] &)] > EulerPhi[n]/2]] (* _Michael De Vlieger_, May 21 2017 *)
%o A048868 (PARI)
%o A048868 is(n) = {my(f = factor(n), e = eulerphi(f), o = omega(f), pr = primepi(n) - o, c = e - pr); c < pr
%o A048868 } \\ _David A. Corneth_, Jun 09 2024
%o A048868 (PARI)
%o A048868 upto(n) = {
%o A048868 	my(res = List(), qp = 0, t = 0);
%o A048868 	forfactored(i = 1, n,
%o A048868 		if(isprime(i[1]),
%o A048868 			qp++;
%o A048868 		);
%o A048868 		e = eulerphi(i[2]);
%o A048868 		o = omega(i[2]);
%o A048868 		if(e < (qp - o)<<1,
%o A048868 			t++;
%o A048868 			listput(res, i[1]);
%o A048868 		);
%o A048868 	);	
%o A048868 	res
%o A048868 } \\ _David A. Corneth_, Jun 09 2024
%Y A048868 A000720(n) - A001221(n) > A000010(n) - (A000720(n)-A001221(n)).
%K A048868 nonn
%O A048868 1,1
%A A048868 _Labos Elemer_