A140696 a(n) = the number of positive divisors of A140695(n).

4, 4, 4, 6, 4, 4, 6, 8, 6, 4, 4, 8, 6, 6, 4, 10, 6, 6, 8, 4, 4, 6, 8, 6, 8, 4, 6, 6, 8, 4, 4, 12, 6, 4, 6, 6, 8, 4, 8, 10, 8, 6, 6, 4, 16, 4, 6, 12, 8, 4, 8, 12, 4, 15, 4, 6, 6, 12, 6, 8, 4, 12, 10, 6, 4, 16, 8, 6, 6, 8, 10, 4, 8, 8, 6, 8, 14, 4, 12, 12, 4, 4, 6, 10, 16, 6, 4, 16, 4, 12, 8, 12, 4, 8, 12

Offset

1,1

Links

Table of n, a(n) for n=1..95.

Formula

a(n) = A000005(A140695(n)). - Michel Marcus, Jul 13 2025

Mathematica

a140695=Select[Range[235], 1 < Mod[ #, Length[Divisors[ # ]]] && GCD[ #, Length[Divisors[ # ]]] > 1 &]; DivisorSigma[0, a140695] (* James C. McMahon, Jul 12 2025 *)

Crossrefs

Cf. A000005, A140695.

Sequence in context: A348677 A130331 A141241 * A160401 A114742 A273909

Adjacent sequences: A140693 A140694 A140695 * A140697 A140698 A140699

Keyword

nonn

Author

Leroy Quet, May 23 2008

Extensions

Extended by Ray Chandler, Jun 25 2009

Status

approved