login

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”).

a(n) = n + A001222(n) - 1.
2

%I #10 Feb 14 2014 07:50:39

%S 0,2,3,5,5,7,7,10,10,11,11,14,13,15,16,19,17,20,19,22,22,23,23,27,26,

%T 27,29,30,29,32,31,36,34,35,36,39,37,39,40,43,41,44,43,46,47,47,47,52,

%U 50,52,52,54,53,57,56,59,58,59,59,63,61,63,65,69,66,68,67,70,70,72,71,76,73,75,77,78,78,80,79,84,84,83

%N a(n) = n + A001222(n) - 1.

%C a(n) = n + (number of prime factors counted with multiplicity) - 1.

%H Vincenzo Librandi, <a href="/A222312/b222312.txt">Table of n, a(n) for n = 1..1000</a>

%p with(numtheory); [seq(n+bigomega(n)-1,n=1..100)];

%t Table[n+PrimeOmega[n]-1,{n,90}] (* _Harvey P. Dale_, Feb 01 2014 *)

%Y Cf. A001222, A213980.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Feb 16 2013