A062069 a(n) = sigma(d(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisors function (A000203).
1, 3, 3, 4, 3, 7, 3, 7, 4, 7, 3, 12, 3, 7, 7, 6, 3, 12, 3, 12, 7, 7, 3, 15, 4, 7, 7, 12, 3, 15, 3, 12, 7, 7, 7, 13, 3, 7, 7, 15, 3, 15, 3, 12, 12, 7, 3, 18, 4, 12, 7, 12, 3, 15, 7, 15, 7, 7, 3, 28, 3, 7, 12, 8, 7, 15, 3, 12, 7, 15, 3, 28, 3, 7, 12, 12, 7, 15, 3, 18, 6, 7, 3, 28, 7, 7, 7, 15, 3
Offset: 1
Keywords
Examples
sigma(d(12)) = sigma(6) = 12.
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harry J. Smith)
Programs
-
Maple
A062069:= (n-> numtheory[sigma](numtheory[tau](n))): seq (A062069(n), n=1..40); # Jani Melik, Jan 25 2011
-
Mathematica
Table[DivisorSigma[1, DivisorSigma[0, n]], {n, 1, 80}] (* Carl Najafi, Aug 16 2011 *)
-
PARI
v=[]; for(n=1,150,v=concat(v, sigma(numdiv(n)))); v
-
PARI
{ for (n=1, 1000, write("b062069.txt", n, " ", sigma(numdiv(n))) ) } \\ Harry J. Smith, Jul 31 2009
Formula
Extensions
More terms from Jason Earls, Jun 19 2001
Comments