login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A101871
Number of Abelian groups of order 2n+1.
4
1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1
OFFSET
0,5
FORMULA
From Amiram Eldar, Sep 23 2023: (Start)
a(n) = A000688(2*n+1) = A000688(4*n+2).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2 * A048651 * A021002 = 1.32545452721253858057... . (End)
MATHEMATICA
a[n_] := FiniteAbelianGroupCount[2*n + 1]; Array[a, 100, 0] (* Amiram Eldar, Sep 23 2023 *)
CROSSREFS
Bisection of A000688.
Sequence in context: A354523 A116531 A375039 * A101875 A081387 A261795
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 28 2005
EXTENSIONS
More terms from Joshua Zucker, May 10 2006
STATUS
approved