Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Oct 09 2024 07:31:58
%S 1,1,1,1,2,2,1,3,1,2,4,3,2,3,2,3,5,3,1,3,3,3,4,2,3,4,2,6,4,3,3,4,3,2,
%T 5,4,1,4,5,5,5,2,4,3,3,5,5,2,2,5,4,3,4,3,3,6,4,4,5,5,7,3,3,4,5,5,2,6,
%U 3,5,5,4,4,5,3,7,6,4,4,3,2,4,5,4,2,4,3,2,4,4,4,5,4,6,7,4,3,5,1,4
%N a(n) = number of prime factors of (3^n + 10) counted with multiplicity.
%H Amiram Eldar, <a href="/A255542/b255542.txt">Table of n, a(n) for n = 0..257</a> (terms 0..151 from Zak Seidov)
%F a(n) = A001222(3^n+10).
%e a(0) = 1 because 3^0+10 = 11 is prime.
%e a(4) = 2 because 3^4+10 = 91 = 7*13 is semiprime.
%e a(7) = 3 because 3^7+10 = 2197 = 13*13*13 is 3-almost prime.
%e a(10) = 4 because 3^7+10 = 59059 = 7*11*13*59 is 4-almost prime.
%e a(16) = 5 because 3^16+10 = 43046731 = 7*13*23*131*157 is 5-almost prime.
%t a[n_]:= PrimeOmega[3^n+10];
%o (PARI) a(n) = bigomega(3^n+10);
%Y Cf. A001222, A102907, A217137.
%K nonn
%O 0,5
%A _Zak Seidov_, Feb 25 2015