The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A337524 a(n) = d(n) * (d(n) - 1), where d is the number of divisors of n (A000005). 1
0, 2, 2, 6, 2, 12, 2, 12, 6, 12, 2, 30, 2, 12, 12, 20, 2, 30, 2, 30, 12, 12, 2, 56, 6, 12, 12, 30, 2, 56, 2, 30, 12, 12, 12, 72, 2, 12, 12, 56, 2, 56, 2, 30, 30, 12, 2, 90, 6, 30, 12, 30, 2, 56, 12, 56, 12, 12, 2, 132, 2, 12, 30, 42, 12, 56, 2, 30, 12, 56, 2, 132, 2, 12, 30, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Number of distinct nonsquare m X n matrices such that m and n are divisors of n.
LINKS
MATHEMATICA
Table[DivisorSigma[0, n]^2 - DivisorSigma[0, n], {n, 100}]
#(#-1)&/@DivisorSigma[0, Range[100]] (* Harvey P. Dale, Nov 03 2022 *)
CROSSREFS
Cf. A000005 (tau).
Equals twice A066446.
Sequence in context: A176991 A264666 A283362 * A324047 A091818 A324202
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Aug 30 2020
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 June 3 00:27 EDT 2024. Contains 373054 sequences. (Running on oeis4.)