|
%I #13 Oct 14 2019 13:55:40
%S 0,1,1,2,1,3,3,7,21,159,12927,132571335
%N Sum of digits when A328316(n) is written in primorial base; number of prime factors in A328316(1+n), counted with multiplicity.
%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F a(n) = A276150(A328316(n)).
%F a(n) = A001222(A328316(1+n)).
%o (PARI)
%o A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328316(n) = if(!n,0,A276086(A328316(n-1)));
%o A276150(n) = { my(s=0, p=2, d); while(n, d = (n%p); s += d; n = (n-d)/p; p = nextprime(1+p)); (s); };
%o A328319(n) = A276150(A328316(n));
%o \\ Or alternatively, more slowly as:
%o A328319(n) = bigomega(A328316(1+n));
%Y Cf. A001221, A276086, A276150, A328316, A328317, A328318, A328322.
%K nonn,more,hard
%O 0,4
%A _Antti Karttunen_, Oct 14 2019
|
