|
| |
|
|
A067742
|
|
Number of middle divisors of n, i.e. divisors in the half-open interval [sqrt(n/2), sqrt(n*2)).
|
|
7
| |
|
|
1, 1, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 0, 2, 1, 0, 1, 0, 2, 0, 0, 0, 2, 1, 0, 0, 2, 0, 2, 0, 1, 0, 0, 2, 1, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 2, 1, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 2, 0, 0, 0, 2, 0, 2, 2, 0, 0, 0, 0, 2, 0, 1, 2, 1, 0, 0, 0, 2, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| a(A128605(n)) = n and a(m) <> n for m < A128605(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 14 2007
|
|
|
REFERENCES
| Problem 10847, Amer. Math. Monthly 109, (2002), p. 80.
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| G.f.: sum((-1)^(k-1)*q^(k+1 choose 2)/(1-q^k), k, 1, inf)
|
|
|
EXAMPLE
| a(6)=2 because 2 divisors of 6 (i.e. 2 and 3) are between sqrt(3) and sqrt(12).
|
|
|
PROG
| (PARI from M. F. Hasler, May 12 2008) A067743(n)=sumdiv( n, d, d*d<n/2 || d*d >= 2*n )
|
|
|
CROSSREFS
| Cf. A067743, A071090.
A071562 lists all n such that a(n) is nonzero.
Sequence in context: A085861 A077266 A129561 * A089233 A066620 A025427
Adjacent sequences: A067739 A067740 A067741 * A067743 A067744 A067745
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Marc LeBrun (mlb(AT)well.com), Jan 29 2002
|
| |
|
|
