|
|
A337176
|
|
Number of pairs of divisors of n, (d1,d2), such that d1 <= d2 and d1*d2 < sqrt(n).
|
|
0
|
|
|
0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 4, 2, 3, 1, 5, 1, 3, 2, 4, 1, 5, 1, 4, 2, 3, 2, 5, 1, 3, 2, 5, 1, 6, 1, 4, 3, 3, 1, 7, 1, 4, 2, 4, 1, 6, 2, 5, 2, 3, 1, 8, 1, 3, 3, 4, 2, 6, 1, 5, 2, 5, 1, 9, 1, 3, 3, 5, 2, 6, 1, 7, 2, 3, 1, 10, 2, 3, 3, 6, 1, 9, 2, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{d1|n, d2|n} (1 - sign(floor(d1*d2/sqrt(n)))).
|
|
EXAMPLE
|
a(24) = 5; (1,1), (1,2), (1,3), (1,4), (2,2).
a(25) = 1; (1,1).
a(26) = 3; (1,1), (1,2), (2,2).
a(27) = 2; (1,1), (1,3).
|
|
MATHEMATICA
|
Table[Sum[Sum[(1 - Sign[Floor[(i*k)/Sqrt[n]]]) (1 - Ceiling[n/k] + Floor[n/k]) (1 - Ceiling[n/i] + Floor[n/i]), {i, k}], {k, n}], {n, 80}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|