login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344337 a(n) = 9^omega(n), where omega(n) is the number of distinct primes dividing n. 1
1, 9, 9, 9, 9, 81, 9, 9, 9, 81, 9, 81, 9, 81, 81, 9, 9, 81, 9, 81, 81, 81, 9, 81, 9, 81, 9, 81, 9, 729, 9, 9, 81, 81, 81, 81, 9, 81, 81, 81, 9, 729, 9, 81, 81, 81, 9, 81, 9, 81, 81, 81, 9, 81, 81, 81, 81, 81, 9, 729, 9, 81, 81, 9, 81, 729, 9, 81, 81, 729, 9, 81, 9, 81, 81, 81 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A001019(A001221(n)).
Multiplicative with a(p^e) = 9.
a(n) = Sum_{d|n} mu(d)^2 * tau(d)^3.
Dirichlet g.f.: Product_{p prime} (1 + 9/(p^s-1)). - Amiram Eldar, Sep 19 2023
MATHEMATICA
Table[9^PrimeNu[n], {n, 1, 100}] (* Amiram Eldar, May 15 2021 *)
PROG
(PARI) a(n) = 9^omega(n);
(PARI) a(n) = prod(k=1, #f=factor(n)[, 2], 9);
(PARI) a(n) = sumdiv(n, d, moebius(d)^2*numdiv(d)^3);
CROSSREFS
k^omega(n): A034444 (k=2), A074816 (k=3), A082476 (k=5), this sequence (k=9).
Sequence in context: A242893 A275485 A346263 * A293832 A277223 A144586
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 15 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 23:06 EDT 2024. Contains 374615 sequences. (Running on oeis4.)