|
|
A333805
|
|
Number of odd divisors of n that are < sqrt(n).
|
|
36
|
|
|
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 3, 1, 1, 3, 1, 2, 2, 1, 1, 2, 3, 1, 2, 1, 1, 3, 1, 2, 2, 1, 2, 2, 1, 1, 3, 2, 1, 2, 1, 1, 4, 2, 1, 2, 1, 2, 2, 1, 2, 3, 2, 1, 2, 1, 1, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
COMMENTS
|
If we define a divisor d|n to be strictly inferior if d < n/d, then strictly inferior divisors are counted by A056924 and listed by A341674. This sequence counts strictly inferior odd divisors. - Gus Wiseman, Feb 26 2021
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>=1} x^(2*k*(2*k - 1)) / (1 - x^(2*k - 1)).
|
|
EXAMPLE
|
The strictly inferior odd divisors of 945 are 1, 3, 5, 7, 9, 15, 21, 27, so a(945) = 8. - Gus Wiseman, Feb 27 2021
|
|
MATHEMATICA
|
Table[DivisorSum[n, 1 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 90}]
nmax = 90; CoefficientList[Series[Sum[x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
|
|
PROG
|
|
|
CROSSREFS
|
Dominated by A001227 (number of odd divisors).
Strictly inferior divisors (not just odd) are counted by A056924.
The case of prime divisors is A333806.
The strictly superior version is A341594.
The case of squarefree divisors is A341596.
The case of prime-power divisors is A341677.
A006530 selects the greatest prime factor.
A020639 selects the smallest prime factor.
- Odd -
A026424 lists numbers with odd Omega.
A027193 counts odd-length partitions.
- Inferior divisors -
A033676 selects the greatest inferior divisor.
A033677 selects the smallest superior divisor.
A038548 counts superior (or inferior) divisors.
A060775 selects the greatest strictly inferior divisor.
A341674 lists strictly inferior divisors.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|