A324387 Minimal number of primorials (A002110) that add to the n-th number that is a product of primorials: a(n) = A276150(A025487(n)).

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

Author

Antti Karttunen, Feb 27 2019

Keywords

• nonn

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)
• Index entries for sequences related to primorial base
• Index entries for sequences related to primorial numbers

Crossrefs

Cf. A002110, A025487, A098719 (positions of ones), A276150, A324342.

Cf. A324382 for a subsequence, and A324383, A324386 for permutations of this sequence.

Programs

PARI

A276150(n) = { my(s=0,m); forprime(p=2, , if(!n, return(s)); m = n%p; s += m; n = (n-m)/p); };
A324387(n) = A276150(A025487(n));

Formula

a(n) = A276150(A025487(n)).