|
%I #21 Apr 21 2024 09:59:23
%S 2,1,2,2,1,1,2,2,2,1,1,4,1,1,3,2,3,2,2,2,1,1,2,1,2,2,2,1,2,3,2,1,3,2,
%T 2,1,3,1,2,3,3,4,3,2,1,2,3,2,2,2,3,3,2,2,4,1,3,3,2,4,3,2,2,2,1,2,2,3,
%U 3,2,2,2,2,4,2,1,2,2,4,2,2,2,1,3,3,2,2,2,2,3,3,2,2,3,2,1,2,2,2,4,2,2,2,4,2
%N Number of prime divisors of (A002997(n) - 2) counted with multiplicity.
%C 62756641 is the first Carmichael number k such that k-2 has 5 prime divisors (counted with multiplicity).
%C What is the average value function of a(n) when n goes to infinity?
%C If these number act like typical numbers of their size, then standard heuristics suggest an average value of log log n since there are between x^(1/3) and x Carmichael numbers up to x for large enough x. - _Charles R Greathouse IV_, May 09 2016
%H Amiram Eldar, <a href="/A272772/b272772.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A001222(A002997(n)-2).
%e a(1) = 2 because 561 - 2 = 559 has 2 prime divisors that are 13 and 43.
%o (PARI) isA002997(n)=my(f); bittest(n, 0) && !for(i=1, #f=factor(n)~, (f[2, i]==1 && n%(f[1, i]-1)==1)||return) && #f>1
%o for(n=561, 1e7, if(isA002997(n), print1(bigomega(n-2), ", ")));
%Y Cf. A001222, A002997, A135717.
%K nonn
%O 1,1
%A _Altug Alkan_, May 06 2016
|
