|
| |
|
|
A033831
|
|
Number of d dividing n such that d>=3 and 1<=n/d<=d-2.
|
|
10
| |
|
|
0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 5, 1, 3, 2, 3, 1, 4, 2, 3, 2, 2, 1, 6, 1, 2, 3, 3, 2, 4, 1, 3, 2, 4, 1, 5, 1, 2, 3, 3, 2, 4, 1, 5, 2, 2, 1, 6, 2, 2, 2, 4, 1, 5, 2, 3, 2, 2, 2, 6, 1, 3, 3, 4, 1, 4, 1, 4, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| G.f.: Sum(x^(n^2+2*n)/(1-x^n),n = 1 .. infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), May 13 2008
|
|
|
MAPLE
| with(numtheory): for n from 1 to 200 do it := divisors(n): count := 0: for i from 1 to nops(it) do if it[i]>=3 and 1<=n/it[i] and n/it[i]<=(it[i]-2) then count := count+1 fi :od: printf(`%d, `, count) od:
|
|
|
CROSSREFS
| Sequence in context: A107459 A087976 A117277 * A033105 A106703 A127267
Adjacent sequences: A033828 A033829 A033830 * A033832 A033833 A033834
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Naohiro Nomoto (6284968128(AT)geocities.co.jp)
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 20 2000
|
| |
|
|
