login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354451 Number of middle divisors of 2*n-1. 1
1, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
COMMENTS
a(n) is the number of middle divisors of the n-th odd number.
a(n) is also the width of the terrace at the level 2*n-1 starting from the top in the main diagonal of the stepped pyramid described in A245092.
a(n) is also the number of central subparts in the symmetric representation of sigma(2n-1). For more information about the subparts see A279387.
LINKS
FORMULA
a(n) = A067742(2n-1).
a(n) = A067742(A005408(n-1)).
MATHEMATICA
a[n_] := DivisorSum[2*n - 1, 1 &, n <= #^2 < 4*n - 2 &]; Array[a, 100] (* Amiram Eldar, Jun 01 2022 *)
CROSSREFS
Bisection of A067742.
Sequence in context: A319000 A083915 A083892 * A089814 A063100 A353377
KEYWORD
nonn
AUTHOR
Omar E. Pol, May 30 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)