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

A324387
Minimal number of primorials (A002110) that add to the n-th number that is a product of primorials: a(n) = A276150(A025487(n)).
7
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, 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, 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
OFFSET
1,3
COMMENTS
A098719 gives the positions of ones in this sequence. See also comments in A324383.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10001 (based on the b-file of A025487 as computed by Will Nicholes and Franklin T. Adams-Watters)
FORMULA
a(n) = A276150(A025487(n)).
PROG
(PARI)
A276150(n) = { my(s=0, m); forprime(p=2, , if(!n, return(s)); m = n%p; s += m; n = (n-m)/p); };
CROSSREFS
Cf. A002110, A025487, A098719 (positions of ones), A276150, A324342.
Cf. A324382 for a subsequence, and A324383, A324386 for permutations of this sequence.
Sequence in context: A262346 A242560 A204596 * A163373 A117193 A325707
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 27 2019
STATUS
approved