cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 13 results. Next

A003051 Number of inequivalent sublattices of index n in hexagonal lattice, where two sublattices are equivalent if they are related by a rotation or reflection preserving the hexagonal lattice.

Original entry on oeis.org

1, 1, 2, 3, 2, 3, 3, 5, 4, 4, 3, 8, 4, 5, 6, 9, 4, 8, 5, 10, 8, 7, 5, 15, 7, 8, 9, 13, 6, 14, 7, 15, 10, 10, 10, 20, 8, 11, 12, 20, 8, 18, 9, 17, 16, 13, 9, 28, 12, 17, 14, 20, 10, 22, 14, 25, 16, 16, 11, 34, 12, 17, 21, 27, 16, 26, 13, 24, 18, 26, 13, 40, 14
Offset: 1

Views

Author

Keywords

Comments

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
From Andrey Zabolotskiy, Mar 10 2018: (Start)
If only primitive sublattices are considered, we get A003050.
Here only rotations and reflections preserving the parent hexagonal lattice are allowed. If reflections are not allowed, we get A145394. If any rotations and reflections are allowed, we get A300651.
In other words, the parent lattice of the sublattices under consideration has Patterson symmetry group p6mm, and two sublattices are considered equivalent if they are related via a symmetry from that group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145391 (c2mm), A145392 (p4), A145393 (p4mm), A145394 (p6).
Rutherford says at p. 161 that his sequence for p6mm differs from this sequence, but it seems that with the current definition and terms of this sequence, this actually is his p6mm sequence, and the sequence he thought to be this one is actually A300651. Also, he says that a(n) != A300651(n) only when A002324(n) > 2 (first time happens at n = 49), but actually these two sequences differ at other terms, too, for example, at n = 42 (see illustration). (End)

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

a(n) = Sum_{ m^2 | n } A003050(n/m^2).
a(n) = (A000203(n) + 2*A002324(n) + 3*A145390(n))/6. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ d|n } A112689(d+1). - Andrey Zabolotskiy, Aug 29 2019
a(n) = Sum_{ d|n } floor(d/6) + 1 - 1*[d == 2 or 6 (mod 12)] + 1*[d == 4 (mod 12)]. [Kurth] - Brahadeesh Sankarnarayanan, Feb 24 2023

A113415 Expansion of Sum_{k>0} x^k/(1-x^(2k))^2.

Original entry on oeis.org

1, 1, 3, 1, 4, 3, 5, 1, 8, 4, 7, 3, 8, 5, 14, 1, 10, 8, 11, 4, 18, 7, 13, 3, 17, 8, 22, 5, 16, 14, 17, 1, 26, 10, 26, 8, 20, 11, 30, 4, 22, 18, 23, 7, 42, 13, 25, 3, 30, 17, 38, 8, 28, 22, 38, 5, 42, 16, 31, 14, 32, 17, 55, 1, 44, 26, 35, 10, 50, 26, 37, 8, 38, 20, 65, 11, 50, 30, 41
Offset: 1

Views

Author

Michael Somos, Oct 29 2005

Keywords

Comments

Arithmetic mean between the number of odd divisors (A001227) and their sum (A000593). This fact was essentially found by the algorithmic search of Jon Maiga's Sequence Machine, and is easily seen to be correct when compared to the PARI-program given by the original author. - Antti Karttunen, Dec 07 2021

Crossrefs

Quadrisection of A349916.

Programs

  • Mathematica
    Array[DivisorSum[#, If[OddQ[#], (# + 1)/2, 0] &] &, 79] (* Michael De Vlieger, Dec 08 2021 *)
  • PARI
    a(n)=if(n<1, 0, sumdiv(n, d, if(d%2, (d+1)/2)))

Formula

G.f.: Sum_{k>0} x^k/(1-x^(2k))^2 = Sum_{k>0} k x^(2k-1)/(1-x^(2k-1)).
a(n) = (1/2) * Sum_{d|n} (d+1)*(d mod 2). - Wesley Ivan Hurt, Nov 25 2021 [From PARI prog]
From Antti Karttunen, Dec 07 2021: (Start)
All these formulas, except the last, were found by the Sequence Machine in some form or another:
a(n) = (1/2) * (A000593(n)+A001227(n)).
a(n) = A069734(A000265(n)). [See either Rutherford's or Luschny's formula in A069734]
a(n) = A349371(n) / A001511(n).
a(n) = A349371(A000265(n)) = A336840(A064989(n)).
a(n) = a(2*n) = a(A000265(n)) = A349916(4*n).
(End)

A145393 Number of inequivalent sublattices of index n in square lattice, where two sublattices are considered equivalent if one can be rotated or reflected to give the other, with that rotation or reflection preserving the parent square lattice.

Original entry on oeis.org

1, 2, 2, 4, 3, 5, 3, 7, 5, 7, 4, 11, 5, 8, 8, 12, 6, 13, 6, 15, 10, 11, 7, 21, 10, 13, 12, 18, 9, 22, 9, 21, 14, 16, 14, 29, 11, 17, 16, 29, 12, 28, 12, 25, 23, 20, 13, 39, 16, 27, 20, 29, 15, 34, 20, 36, 22, 25, 16, 50, 17, 26, 29, 38, 24, 40, 18, 36, 26, 40
Offset: 1

Views

Author

N. J. A. Sloane, Feb 23 2009

Keywords

Comments

From Andrey Zabolotskiy, Mar 12 2018: (Start)
If reflections are not allowed, we get A145392. If any rotations and reflections are allowed, we get A054346.
The parent lattice of the sublattices under consideration has Patterson symmetry group p4mm, and two sublattices are considered equivalent if they are related via a symmetry from that group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145391 (c2mm), A145392 (p4), A145394 (p6), A003051 (p6mm).
Rutherford says at p. 161 that a(n) != A054346(n) only when A002654(n) > 2, but actually these two sequence differ at other terms, too, for example, at n = 30 (see illustration). (End)

Crossrefs

Programs

  • Mathematica
    terms = 70;
    CoefficientList[Sum[(1/((1-x^m)(1-x^(4m)))-1), {m, 1, terms}] + O[x]^(terms + 1), x] // Rest (* Jean-François Alcover, Aug 05 2018 *)

Formula

a(n) = (A000203(n) + A002654(n) + A069735(n) + A145390(n))/4. [Rutherford] - N. J. A. Sloane, Mar 13 2009
G.f.: Sum_{ m>=1 } (1/((1-x^m)(1-x^(4m))) - 1). [Hanany, Orlando & Reffert, eq. (6.8)] - Andrey Zabolotskiy, Jul 05 2017
a(n) = Sum_{ m: m^2|n } A019590(n/m^2) + A157228(n/m^2) + A157226(n/m^2) + A157230(n/m^2) + A157231(n/m^2) = A053866(n) + A025441(n) + Sum_{ m: m^2|n } A157226(n/m^2) + A157230(n/m^2) + A157231(n/m^2). [Rutherford] - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A008621(d) = Sum_{ d|n } (1 + floor(d/4)). [From the above-given g.f.] - Andrey Zabolotskiy, Jul 17 2019

Extensions

New name from Andrey Zabolotskiy, Mar 12 2018

A304182 Number of primitive inequivalent mirror-symmetric sublattices of rectangular lattice of index n.

Original entry on oeis.org

1, 3, 2, 4, 2, 6, 2, 4, 2, 6, 2, 8, 2, 6, 4, 4, 2, 6, 2, 8, 4, 6, 2, 8, 2, 6, 2, 8, 2, 12, 2, 4, 4, 6, 4, 8, 2, 6, 4, 8, 2, 12, 2, 8, 4, 6, 2, 8, 2, 6, 4, 8, 2, 6, 4, 8, 4, 6, 2, 16, 2, 6, 4, 4, 4, 12, 2, 8, 4, 12, 2, 8, 2, 6, 4, 8, 4, 12, 2, 8, 2, 6, 2, 16, 4
Offset: 1

Views

Author

Andrey Zabolotskiy, May 07 2018

Keywords

Examples

			There are 6 = A001615(4) lattices in Z^2 whose quotient group is C_4. The reflection through an axis relates <(4,0), (1,1)> and <(4,0), (3,1)>. The remaining 4 = a(4) lattices are fixed.
		

Crossrefs

Cf. A069735 (not only primitive sublattices), A304183 (primitive oblique sublattices), A069734 (all sublattices).
Cf. other columns of tables 4 and 5 from [Rutherford, 2009]: A001615, A060594, A157223, A000089, A157224, A000086, A157227, A019590, A157228, A157226, A157230, A157231, A154272, A157235.

Programs

  • Mathematica
    f[p_, e_] := If[p == 2, If[e == 1, 3, 4], 2]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 22 2022 *)

Formula

From Álvar Ibeas, Mar 18 2021: (Start)
For n odd, a(n) = A034444(n) = 2^(A001221(n)).
For n even, a(n) = A034444(n) + A034444(n/2). If 4|n, a(n) = 2^(A001221(n) + 1); otherwise, a(n) = 3 * 2^(A001221(n) - 1).
Multiplicative with a(2) = 3, a(2^e) = 4 (for e>1), and a(p^e) = 2 (for p>2).
Dirichlet g.f.: (1+2^(-s)) * zeta(s)^2 / zeta(2s).
(End)
Sum_{k=1..n} a(k) ~ (log(n) + 2*gamma - log(2)/3 - 2*zeta'(2)/zeta(2) - 1)*9*n/Pi^2, where gamma is Euler's constant (A001620). - Amiram Eldar, Dec 31 2022

A145392 Number of inequivalent sublattices of index n in square lattice, where two sublattices are considered equivalent if one can be rotated by a multiple of Pi/2 to give the other.

Original entry on oeis.org

1, 2, 2, 4, 4, 6, 4, 8, 7, 10, 6, 14, 8, 12, 12, 16, 10, 20, 10, 22, 16, 18, 12, 30, 17, 22, 20, 28, 16, 36, 16, 32, 24, 28, 24, 46, 20, 30, 28, 46, 22, 48, 22, 42, 40, 36, 24, 62, 29, 48, 36, 50, 28, 60, 36, 60, 40, 46, 30, 84, 32, 48, 52, 64, 44, 72, 34, 64, 48, 72
Offset: 1

Views

Author

N. J. A. Sloane, Feb 23 2009

Keywords

Comments

From Andrey Zabolotskiy, Mar 12 2018: (Start)
The parent lattice of the sublattices under consideration has Patterson symmetry group p4, and two sublattices are considered equivalent if they are related via a symmetry from that group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145391 (c2mm), A145393 (p4mm), A145394 (p6), A003051 (p6mm).
If we count sublattices related by parent-lattice-preserving reflection as equivalent, we get A145393 instead of this sequence. If we count sublattices related by rotation of the sublattice only (but not parent lattice; equivalently, sublattices related by rotation by angle which is not a multiple of Pi/2; see illustration in links) as equivalent, we get A054345. If we count sublattices related by any rotation or reflection as equivalent, we get A054346.
Rutherford says at p. 161 that a(n) != A054345(n) only when A002654(n) > 1, but actually these two sequences differ at other terms, too, for example, at n = 15 (see illustration). (End)

Crossrefs

Programs

Formula

a(n) = (A000203(n) + A002654(n))/2. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ m: m^2|n } A000089(n/m^2) + A157224(n/m^2) = A002654(n) + Sum_{ m: m^2|n } A157224(n/m^2). - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A004525(d). - Andrey Zabolotskiy, Aug 29 2019

Extensions

New name from Andrey Zabolotskiy, Mar 12 2018

A145394 Number of inequivalent sublattices of index n in hexagonal lattice, where two sublattices are considered equivalent if one can be rotated by a multiple of Pi/3 to give the other.

Original entry on oeis.org

1, 1, 2, 3, 2, 4, 4, 5, 5, 6, 4, 10, 6, 8, 8, 11, 6, 13, 8, 14, 12, 12, 8, 20, 11, 14, 14, 20, 10, 24, 12, 21, 16, 18, 16, 31, 14, 20, 20, 30, 14, 32, 16, 28, 26, 24, 16, 42, 21, 31, 24, 34, 18, 40, 24, 40, 28, 30, 20, 56, 22, 32, 36, 43, 28, 48, 24, 42, 32, 48, 24, 65, 26, 38, 42, 48, 32, 56, 28, 62
Offset: 1

Views

Author

N. J. A. Sloane, Feb 23 2009

Keywords

Comments

Also, apparently a(n) is the number of nonequivalent (up to lattice-preserving affine transformation) triangles on 2D square lattice of area n/2 [Karpenkov]. - Andrey Zabolotskiy, Jul 06 2017
From Andrey Zabolotskiy, Jan 18 2018: (Start)
The parent lattice of the sublattices under consideration has Patterson symmetry group p6, and two sublattices are considered equivalent if they are related via a symmetry from that group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145391 (c2mm), A145392 (p4), A145393 (p4mm), A003051 (p6mm).
If we count sublattices related by parent-lattice-preserving reflection as equivalent, we get A003051 instead of this sequence. If we count sublattices related by rotation of the sublattice only (but not parent lattice; equivalently, sublattices related by rotation by angle which is not a multiple of Pi/3; see illustration in links) as equivalent, we get A054384. If we count sublattices related by any rotation or reflection as equivalent, we get A300651.
Rutherford says at p. 161 that a(n) != A054384(n) only when A002324(n) > 1, but actually these two sequences differ at other terms, too, for example, at n = 14 (see illustration). (End)

Crossrefs

Programs

  • Mathematica
    a[n_] := (DivisorSigma[1, n] + 2 DivisorSum[n, Switch[Mod[#, 3], 1, 1, 2, -1, 0, 0] &])/3; Array[a, 80] (* Jean-François Alcover, Dec 03 2015 *)
  • PARI
    A002324(n) = if( n<1, 0, sumdiv(n, d, (d%3==1) - (d%3==2)));
    A000203(n) = if( n<1, 0, sigma(n));
    a(n) = (A000203(n) + 2 * A002324(n)) / 3;
    \\ Joerg Arndt, Oct 13 2013

Formula

a(n) = (A000203(n) + 2 * A002324(n))/3. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ m: m^2|n } A000086(n/m^2) + A157227(n/m^2) = A002324(n) + Sum_{ m: m^2|n } A157227(n/m^2). [Rutherford] - Andrey Zabolotskiy, Apr 23 2018
a(n) = Sum_{ d|n } A008611(d-1). - Andrey Zabolotskiy, Aug 29 2019

Extensions

New name from Andrey Zabolotskiy, Dec 14 2017

A069733 Number of divisors d of n such that d or n/d is odd. Number of non-orientable coverings of the Klein bottle with n lists.

Original entry on oeis.org

1, 2, 2, 2, 2, 4, 2, 2, 3, 4, 2, 4, 2, 4, 4, 2, 2, 6, 2, 4, 4, 4, 2, 4, 3, 4, 4, 4, 2, 8, 2, 2, 4, 4, 4, 6, 2, 4, 4, 4, 2, 8, 2, 4, 6, 4, 2, 4, 3, 6, 4, 4, 2, 8, 4, 4, 4, 4, 2, 8, 2, 4, 6, 2, 4, 8, 2, 4, 4, 8, 2, 6, 2, 4, 6, 4, 4, 8, 2, 4, 5, 4, 2, 8, 4, 4, 4, 4, 2, 12, 4, 4, 4, 4, 4, 4, 2, 6, 6, 6, 2, 8, 2, 4
Offset: 1

Views

Author

Valery A. Liskovets, Apr 07 2002

Keywords

Comments

Also number of divisors of n that are not divisible by 4. - Vladeta Jovovic, Dec 16 2002

Crossrefs

Programs

Formula

Multiplicative with a(2^e)=2 and a(p^e)=e+1 for e>0 and an odd prime p.
a(n) = d(n)-d(n/4) for 4|n and =d(n) otherwise where d(n) is the number of divisors of n (A000005).
G.f.: Sum_{m>0} x^m*(1+x^m+x^(2*m))/(1-x^(4*m)). - Vladeta Jovovic, Oct 21 2002
From Amiram Eldar, Dec 05 2022: (Start)
Dirichlet g.f.: zeta(s)^2*(1 - 1/4^s).
Sum_{k=1..n} a(k) ~ (3 * n * log(n) + (6*gamma + 2*log(2) - 3)*n)/4, where gamma is Euler's constant (A001620). [Corrected by Andrey Zabolotskiy, Apr 20 2025] (End)
a(n) = A000005(A259445(n)). - David A. Corneth, Aug 28 2023

A069735 Number of regular orientable coverings of the Klein bottle with 2n lists.

Original entry on oeis.org

1, 3, 2, 5, 2, 6, 2, 7, 3, 6, 2, 10, 2, 6, 4, 9, 2, 9, 2, 10, 4, 6, 2, 14, 3, 6, 4, 10, 2, 12, 2, 11, 4, 6, 4, 15, 2, 6, 4, 14, 2, 12, 2, 10, 6, 6, 2, 18, 3, 9, 4, 10, 2, 12, 4, 14, 4, 6, 2, 20, 2, 6, 6, 13, 4, 12, 2, 10, 4, 12, 2, 21, 2, 6, 6, 10, 4, 12, 2, 18, 5, 6, 2, 20, 4, 6, 4, 14, 2, 18
Offset: 1

Views

Author

Valery A. Liskovets, Apr 07 2002

Keywords

Comments

Dirichlet convolution of A000012 by A040001. - R. J. Mathar, Mar 30 2011
a(n) is the number of full-dimensional lattices with volume n in Z^2 which are symmetric about a coordinate axis (equivalently, about both). - Álvar Ibeas, Mar 19 2021

Examples

			x + 3*x^2 + 2*x^3 + 5*x^4 + 2*x^5 + 6*x^6 + 2*x^7 + 7*x^8 + 3*x^9 + 6*x^10 + ...
		

Crossrefs

Equals row sums of triangle A143110. - Gary W. Adamson, Jul 25 2008

Programs

  • Maple
    read("transforms") : nmax := 100 :
    L := [1,1,seq(0,i=1..nmax)] :
    MOBIUSi(%) :
    MOBIUSi(%) ; # R. J. Mathar, Sep 25 2017
    with(NumberTheory): seq(tau(n) + `if`(n::odd, 0, tau(n/2)), n=1..100); # Peter Luschny, Mar 19 2021
  • Mathematica
    d[n_] := DivisorSigma[0, n];
    a[n_] := If[EvenQ[n], d[n] + d[n/2], d[n]];
    Array[a, 100] (* Jean-François Alcover, Aug 27 2019 *)
  • PARI
    {a(n) = if( n<1, 0, numdiv(n) + if( n%2, 0, numdiv( n / 2)))} /* Michael Somos, Mar 24 2012 */

Formula

Multiplicative with a(2^e)=2e+1 and a(p^e)=e+1 for e>0 and an odd prime p.
a(n) = d(n)+d(n/2) for even n and a(n) = d(n) otherwise where d(n) is the number of divisors of n (A000005).
G.f.: Sum_{k>0} x^k*(1+2*x^k)/(1-x^(2*k)). - Vladeta Jovovic, Dec 16 2002
Dirichlet g.f.: (1+2^(-s))*zeta^2(s) [ Rutherford]. - N. J. A. Sloane, Feb 23 2009
Moebius transform is period 2 sequence [ 1, 2, ...]. - Michael Somos, Mar 24 2012
a(2*n - 1) = A099774(n).
a(n) = Sum_{ m: m^2|n } A304182(n/m^2). - Andrey Zabolotskiy, May 07 2018
Sum_{k=1..n} a(k) ~ 3*n*log(n)/2 + (3*gamma - 3/2 - log(2)/2)*n, where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Oct 04 2019
a(n) = 3*tau(n) - tau(2*n). - Ridouane Oudra, Mar 15 2021
a(n) = A320111(n) + (A059841(n)*A000005(n)), i.e. a(n) = A320111(n) if n is odd, and a(n) = A320111(n) + A000005(n) if n is even. - Antti Karttunen, Mar 17 2021
a(n) = A000005(n) + A183063(n) = 2*A000005(n) - A001227(n). - Amiram Eldar, Dec 22 2023

Extensions

Corrected by T. D. Noe, Nov 13 2006

A145391 Number of inequivalent sublattices of index n in centered rectangular lattice.

Original entry on oeis.org

1, 2, 3, 5, 4, 7, 5, 10, 8, 10, 7, 17, 8, 13, 14, 19, 10, 21, 11, 24, 18, 19, 13, 35, 17, 22, 22, 31, 16, 38, 17, 36, 26, 28, 26, 50, 20, 31, 30, 50, 22, 50, 23, 45, 42, 37, 25, 69, 30, 48, 38, 52, 28, 62, 38, 65, 42, 46, 31, 90, 32, 49, 55, 69, 44, 74, 35, 66, 50, 74
Offset: 1

Views

Author

N. J. A. Sloane, Feb 23 2009

Keywords

Comments

The centered rectangular lattice has symmetry group c2mm, or cmm. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145392 (p4), A145393 (p4mm), A145394 (p6), A003051 (p6mm). - Andrey Zabolotskiy, Mar 12 2018

Crossrefs

Programs

  • Mathematica
    a060594[n_] := Switch[Mod[n, 8], 2|6, 2^(PrimeNu[n] - 1), 1|3|4|5|7, 2^PrimeNu[n], 0, 2^(PrimeNu[n] + 1)];
    a145390[n_] := Sum[If[IntegerQ[Sqrt[d]], a060594[n/d], 0], {d, Divisors[n]} ];
    a[n_] := (DivisorSigma[1, n] + a145390[n])/2;
    Array[a, 100] (* Jean-François Alcover, Aug 31 2018 *)

Formula

a(n) = (A000203(n) + A145390(n))/2. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ m: m^2|n } A060594(n/m^2) + A157223(n/m^2) = A145390(n) + Sum_{ m: m^2|n } A157223(n/m^2). - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A004525(d+1). - Andrey Zabolotskiy, Aug 29 2019

Extensions

New name from Andrey Zabolotskiy, Mar 12 2018
New name from Andrey Zabolotskiy, Jan 19 2022

A079247 Number of pairs (p,q), 0 <= p < q, such that p+q divides n.

Original entry on oeis.org

1, 2, 3, 4, 4, 7, 5, 8, 8, 10, 7, 15, 8, 13, 14, 16, 10, 21, 11, 22, 18, 19, 13, 31, 17, 22, 22, 29, 16, 38, 17, 32, 26, 28, 26, 47, 20, 31, 30, 46, 22, 50, 23, 43, 42, 37, 25, 63, 30, 48, 38, 50, 28, 62, 38, 61, 42, 46, 31, 86, 32, 49, 55, 64, 44, 74, 35, 64, 50, 74, 37, 99, 38
Offset: 1

Views

Author

Vladeta Jovovic, Feb 03 2003

Keywords

Comments

Equals left border of triangle A158951. - Gary W. Adamson, Mar 31 2009
Equals row sums of triangle A168509. - Gary W. Adamson, Nov 27 2009
Let c(d_x(n)) = (d_x(n) + 1) / 2 if d_x(n) == 1 (mod 2), and d_x(n) / 2 if d_x(n) == 0 (mod 2), where d_x(n) is the x-th divisor of n, 1 <= d_x(n) <= n, and c(d_x(n)) denotes the cardinality of said divisor within the ordered set of naturals sharing its parity. Then, a(n) = Sum_{i=1..A000005(n)} c(d_i(n)). - Christopher Hohl, Apr 16 2019

Examples

			There are 7 pairs (p,q), 0 <= p < q, such that p+q divides 6: (0,1), (0,2), (0,3), (0,6), (1, 2), (1, 5), (2, 4); thus a(6) = 7.
G.f. = x + 2*x^2 + 3*x^3 + 4*x^4 + 4*x^5 + 7*x^6 + 5*x^7 + 8*x^8 + 8*x^9 + ...
		

Crossrefs

Programs

  • Maple
    with(numtheory): seq((sigma(n)+tau(2*n)-tau(n))/2,n=1 .. 80); # - Ridouane Oudra, Sep 06 2020
  • PARI
    {a(n) = if( n<1, 0, sumdiv( n, d, (1 + d)\2))} /* Michael Somos, Jun 11 2003 */

Formula

Inverse Moebius transform of A008619 (offset 1). - Michael Somos, Jun 11 2003
G.f.: Sum_{k>=1} x^k / ((1 - x^k) * (1 - x^(2*k))). - Michael Somos, Jun 11 2003
G.f.: Sum_{n>=1} A110654(n)*x^n/(1-x^n). - Mircea Merca, Feb 26 2014
a(n) = (1/2)*(A000203(n) + A001227(n)). - Ridouane Oudra, Sep 06 2020
a(n) = A000203(n) - A086670(n). - Ridouane Oudra, Nov 25 2022
Showing 1-10 of 13 results. Next