login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280583 a(n) = product of divisors of the number of divisors of n. 1
1, 2, 2, 3, 2, 8, 2, 8, 3, 8, 2, 36, 2, 8, 8, 5, 2, 36, 2, 36, 8, 8, 2, 64, 3, 8, 8, 36, 2, 64, 2, 36, 8, 8, 8, 27, 2, 8, 8, 64, 2, 64, 2, 36, 36, 8, 2, 100, 3, 36, 8, 36, 2, 64, 8, 64, 8, 8, 2, 1728, 2, 8, 36, 7, 8, 64, 2, 36, 8, 64, 2, 1728, 2, 8, 36, 36, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A007955(A000005(n)).

a(p) = 2 for p = primes (A000040).

a(n) = 3 for squares of primes (A001248).

EXAMPLE

For n = 6; a(n) = product of divisors (tau(6)) = 1*2*4 = 8.

PROG

(MAGMA) [&*[d: d in Divisors(#[d: d in Divisors(n)])]: n in [1..100]]

CROSSREFS

Cf. A000005, A000040, A001248, A007955, A010553, A062069.

Sequence in context: A248577 A015999 A225244 * A177047 A334490 A016001

Adjacent sequences:  A280580 A280581 A280582 * A280584 A280585 A280586

KEYWORD

nonn

AUTHOR

Jaroslav Krizek, Jan 07 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 15:11 EDT 2020. Contains 335576 sequences. (Running on oeis4.)