OFFSET
1,10
COMMENTS
Number of d, 1 <= d <= n, such that there exists an e, 1 <= e <= n, with d*e = n, where * is lunar multiplication.
LINKS
D. Applegate, Table of n, a(n) for n = 1..100000
D. Applegate, C program for lunar arithmetic and number theory [Note: we have now changed the name from "dismal arithmetic" to "lunar arithmetic" - the old name was too depressing]
D. Applegate, M. LeBrun and N. J. A. Sloane, Dismal Arithmetic [Note: we have now changed the name from "dismal arithmetic" to "lunar arithmetic" - the old name was too depressing]
EXAMPLE
The 10 divisors of 10 <= 10 are 1, 2, ..., 9, 10.
a(100) = 19, since the lunar divisors of 100 <= 100 are 1, 2, ..., 9, 10, 20, ..., 90, 100.
MAPLE
(Uses programs from A087062) dd1 := proc(n) local t1, t2, i, j; t1 := []; for i from 1 to n do for j from i to n do if dmul(i, j) = n then t1 := [op(t1), i, j]; fi; od; od; t1 := convert(t1, set); t2 := sort(convert(t1, list)); nops(t2); end;
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Marc LeBrun and N. J. A. Sloane, Oct 19 2003
STATUS
approved