How to code a divisor sequence

Question:How to code a divisor sequence

Posted: David Sycamore 95 Product: Maple

February 21 2021

Requesting a code to compute for n>=1 the number of distinct proper divisors of n which properly divide a proper divisor of n.

0,0,0,1,0,1,0,2,1,1,0,3,0,1,1,3,0,2,0,3,1,1,0,5...

example: n=24= 2^3*3

There are 5 proper divisors of 24 having the above property: 1,2,3,4,6, so a(24)=5.

Share via:

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

Save this setting as your default sorting preference?
Note: You can change your preference any time in your account settings
Don't show this again