This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062319 Number of divisors of n^n, or of A000312(n). 5
 1, 1, 3, 4, 9, 6, 49, 8, 25, 19, 121, 12, 325, 14, 225, 256, 65, 18, 703, 20, 861, 484, 529, 24, 1825, 51, 729, 82, 1653, 30, 29791, 32, 161, 1156, 1225, 1296, 5329, 38, 1521, 1600, 4961, 42, 79507, 44, 4005, 4186, 2209, 48, 9457, 99, 5151, 2704, 5565, 54 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Harry J. Smith, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A000005(A000312(n)). [Enrique Pérez Herrero, Nov 09 2010] MATHEMATICA A062319[n_IntegerQ]:=DivisorSigma[0, n^n]; (* Enrique Pérez Herrero, Nov 09 2010 *) PROG (PARI) je=[]; for(n=0, 200, je=concat(je, numdiv(n^n))); je (PARI) { for (n=0, 1000, write("b062319.txt", n, " ", numdiv(n^n)); ) } \\ Harry J. Smith, Aug 04 2009 (PARI) a(n)=local(fm); fm=factor(n); prod(k=1, matsize(fm)[1], fm[k, 2]*n+1) \\ Franklin T. Adams-Watters, May 03 2011 (MAGMA) [NumberOfDivisors(n^n): n in  [0..60]]; // Vincenzo Librandi, Nov 09 2014 CROSSREFS Cf. A000312. Cf. A000005, A046798, A077592, A035116. [Enrique Pérez Herrero, Nov 09 2010] Sequence in context: A055225 A054791 A167531 * A285265 A330385 A178590 Adjacent sequences:  A062316 A062317 A062318 * A062320 A062321 A062322 KEYWORD easy,nonn AUTHOR Jason Earls, Jul 05 2001 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.

Last modified December 13 03:41 EST 2019. Contains 329968 sequences. (Running on oeis4.)