|
%I #8 Mar 18 2018 09:50:24
%S 3,3,3,3,3,3,3,4,3,4,3,3,3,4,4,3,4,3,3,3,4,3,3,4,3,3,3,4,3,4,3,3,4,4,
%T 4,3,3,4,3,4,4,3,4,3,5,4,3,3,3,3,4,3,3,4,3,4,4,3,3,3,5,4,4,3,3,4,3,4,
%U 3,3,4,4,4,3,3,4,4,3,4,4,4,4,3,5,3,4,3
%N Number of prime factors of the n-th Lucas-Carmichael number.
%C The number of prime factors is always >= 3.
%H Tim Johannes Ohrtmann, <a href="/A300959/b300959.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A001221(A006972(n)).
%o (PARI) islc(n)=my(f=factor(n)); for(i=1, #f[, 1], if((n+1)%(f[i, 1]+1) || f[i, 2]>1, return(0))); #f[, 1]>1; \\ from A006972
%o lista(nn) = for (n=1, nn, if (islc(n), print1(omega(n), ", "))); \\ _Michel Marcus_, Mar 17 2018
%Y Cf. A006972 (Lucas-Carmichael numbers).
%Y Cf. A216925, A216926, A216927, A217002, A217003, A217091 (Lucas-Carmichael numbers with 3 to 8 prime factors).
%Y Cf. A216928 (Least Lucas-Carmichael number with n prime factors).
%K nonn
%O 1,1
%A _Tim Johannes Ohrtmann_, Mar 17 2018
|
