The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A324382

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Minimal number of primorials that add to the n-th highly composite number: a(n) = A276150(A002182(n)).
(history; published version)

#9 by Susanna Cuyler at Tue Feb 26 19:12:41 EST 2019

STATUS

proposed

#8 by Antti Karttunen at Tue Feb 26 15:23:58 EST 2019

STATUS

editing

#7 by Antti Karttunen at Tue Feb 26 15:23:30 EST 2019

EXAMPLE

For n=12, A002182(12) = 240, which is written as "11000" in primorial base (A049345) because 240 = 1*A002110(4) + 1*A002110(3) = 210+30, thus a(12) = 2. (Note that 240 = 30*2*2*2).

For n=18, A002182(18) = 2520 = "110000" in primorial base because 2520 = 1*A002110(5) + 1*A002110(4) = 2310+210, thus a(18) = 2. (Note that 2520 = 210*6*2).

#6 by Antti Karttunen at Tue Feb 26 15:22:27 EST 2019

COMMENTS

Among the first 10000 highly composite numbers, only in two cases a(n) < A112779(n). This happens on A002182(12) = 240 and A002182(18) = 2520. Note that A112779(n) gives the number of primorials needed when A002182(n) is expressed as a product of primorials.

LINKS

#5 by Antti Karttunen at Tue Feb 26 15:07:42 EST 2019

EXAMPLE

CROSSREFS

Cf. also A108602, A112778, A112779, A324342.

#4 by Antti Karttunen at Tue Feb 26 14:39:55 EST 2019

COMMENTS

#3 by Antti Karttunen at Tue Feb 26 14:31:57 EST 2019

CROSSREFS

Cf. also A324342.

#2 by Antti Karttunen at Tue Feb 26 14:28:51 EST 2019

NAME

allocated for Antti Karttunen

DATA

OFFSET

LINKS

FORMULA

PROG

CROSSREFS

KEYWORD

allocated

AUTHOR

STATUS

approved

#1 by Antti Karttunen at Mon Feb 25 15:35:55 EST 2019

NAME

KEYWORD

STATUS