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.
%I A324387 #7 Feb 28 2019 18:54:20
%S A324387 1,1,2,1,2,2,4,4,1,2,2,4,2,4,4,4,4,6,8,6,8,1,2,2,6,6,6,10,2,4,4,6,8,6,
%T A324387 10,4,8,6,8,12,6,10,6,8,12,10,8,12,12,10,16,12,20,1,2,6,8,10,6,10,8,
%U A324387 10,16,14,20,2,4,12,10,10,14,10,16,12,20,6,6,10,8,10,12,20,4,8,14,14,20,14,10,16,14,24,6,12,12
%N A324387 Minimal number of primorials (A002110) that add to the n-th number that is a product of primorials: a(n) = A276150(A025487(n)).
%C A324387 A098719 gives the positions of ones in this sequence. See also comments in A324383.
%H A324387 Antti Karttunen, <a href="/A324387/b324387.txt">Table of n, a(n) for n = 1..10001</a> (based on the b-file of A025487 as computed by Will Nicholes and Franklin T. Adams-Watters)
%H A324387 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324387 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A324387 a(n) = A276150(A025487(n)).
%o A324387 (PARI)
%o A324387 A276150(n) = { my(s=0,m); forprime(p=2, , if(!n, return(s)); m = n%p; s += m; n = (n-m)/p); };
%o A324387 A324387(n) = A276150(A025487(n));
%Y A324387 Cf. A002110, A025487, A098719 (positions of ones), A276150, A324342.
%Y A324387 Cf. A324382 for a subsequence, and A324383, A324386 for permutations of this sequence.
%K A324387 nonn
%O A324387 1,3
%A A324387 _Antti Karttunen_, Feb 27 2019