cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A328630 a(n) is the number of prime factors in A328624(n), counted with multiplicity.

This page as a plain text file.
%I A328630 #7 Oct 25 2019 18:08:19
%S A328630 0,1,1,3,2,2,1,2,3,5,5,5,2,3,5,7,3,3,3,4,2,4,6,6,4,5,4,6,4,4,1,2,2,4,
%T A328630 3,3,3,4,5,7,7,7,5,6,8,10,6,6,7,8,6,8,10,10,9,10,9,11,9,9,2,3,3,5,4,4,
%U A328630 5,6,7,9,9,9,8,9,11,13,9,9,4,5,3,5,7,7,7,8,7,9,7,7,3,4,4,6,5,5,7,8,9,11,11,11,4,5,7,9
%N A328630 a(n) is the number of prime factors in A328624(n), counted with multiplicity.
%H A328630 Antti Karttunen, <a href="/A328630/b328630.txt">Table of n, a(n) for n = 0..30030</a>
%H A328630 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328630 a(n) = A001222(A328624(n)).
%F A328630 a(n) = A276150(A328625(n)).
%o A328630 (PARI)
%o A328630 A328624(n) = { my(m=1, p=2, e, g=1); while(n, e = (n%p); m *= (p^((g*e)%p)); g = e+1; n = n\p; p = nextprime(1+p)); (m); };
%o A328630 A328630(n) = bigomega(A328624(n));
%Y A328630 Cf. A001222, A276150, A328624, A328625, A328628.
%K A328630 nonn
%O A328630 0,4
%A A328630 _Antti Karttunen_, Oct 25 2019