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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015999 a(n) = (tau(n^5) + 4)/5. 15
1, 2, 2, 3, 2, 8, 2, 4, 3, 8, 2, 14, 2, 8, 8, 5, 2, 14, 2, 14, 8, 8, 2, 20, 3, 8, 4, 14, 2, 44, 2, 6, 8, 8, 8, 25, 2, 8, 8, 20, 2, 44, 2, 14, 14, 8, 2, 26, 3, 14, 8, 14, 2, 20, 8, 20, 8, 8, 2, 80, 2, 8, 14, 7, 8, 44, 2, 14, 8, 44, 2, 36, 2, 8, 14, 14, 8, 44, 2, 26, 5, 8, 2, 80, 8, 8
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MAPLE
with(numtheory): A015999:=n->(tau(n^5)+4)/5: seq(A015999(n), n=1..80); # Wesley Ivan Hurt, Apr 10 2015
MATHEMATICA
(DivisorSigma[0, Range[80]^5]+4)/5 (* Wesley Ivan Hurt, Apr 10 2015 *)
PROG
(PARI)
A015999(n) = (numdiv(n^5)+4)/5;
for(n=1, 10000, write("b015999.txt", n, " ", A015999(n)));
\\ Antti Karttunen, Jan 17 2017
(Python)
from sympy import divisor_count
def a(n): return (divisor_count(n**5) + 4)//5
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Apr 14 2017
CROSSREFS
Sequence in context: A141652 A117754 A248577 * A225244 A345281 A338319
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Definition corrected by Vladeta Jovovic, Sep 03 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 16:42 EDT 2024. Contains 376002 sequences. (Running on oeis4.)