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-8 of 8 results.

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

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

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

Original entry on oeis.org

1, 3, 3, 6, 4, 9, 5, 11, 8, 12, 7, 19, 8, 15, 14, 20, 10, 24, 11, 26, 18, 21, 13, 37, 17, 24, 22, 33, 16, 42, 17, 37, 26, 30, 26, 53, 20, 33, 30, 52, 22, 54, 23, 47, 42, 39, 25, 71, 30, 51, 38, 54, 28, 66, 38, 67, 42, 48, 31, 94, 32, 51, 55, 70, 44, 78, 35, 68, 50, 78, 37, 108
Offset: 1

Views

Author

Valery A. Liskovets, Apr 07 2002

Keywords

Comments

Also number of orientable coverings of the Klein bottle with 2n lists (orientable m-list coverings exist only for even m).
Equals row sums of triangle A178650. - Gary W. Adamson, May 31 2010
Also number of inequivalent sublattices of index n of the rectangular lattice, that has the p2mm (pmm) symmetry group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A145391 (c2mm), A145392 (p4), A145393 (p4mm), A145394 (p6), A003051 (p6mm). - Andrey Zabolotskiy, Mar 12 2018

Examples

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

Crossrefs

Programs

  • Maple
    with(numtheory): a := n -> (sigma(n) + tau(n) + `if`(irem(n,2) = 1, 0, tau(n/2)))/2: seq(a(n), n=1..72); # Peter Luschny, Jul 20 2019
  • Mathematica
    a[n_] := (DivisorSigma[1, n] + DivisorSigma[0, n] + If[OddQ[n], 0, DivisorSigma[0, n/2]])/2;
    Array[a, 72] (* Jean-François Alcover, Aug 27 2019, from Maple *)
  • PARI
    {a(n) = if( n<1, 0, sum( k=1, n, sum( j=0, k, n%(j+k) == 0)))} /* Michael Somos, Mar 24 2012 */

Formula

a(n) = A046524(2n) - A069733(2n).
Inverse Moebius transform of: 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, ... G.f.: Sum_{n>0} x^n*(1+x^n-x^(2*n))/(1-x^(2*n))/(1-x^n). - Vladeta Jovovic, Feb 03 2003
a(n) = (A000203(n) + A069735(n))/2. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ m: m^2|n } A304182(n/m^2) + A304183(n/m^2) = A069735(n) + Sum_{ m: m^2|n } A304183(n/m^2). - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A008619(d) = Sum_{ d|n } (1 + floor(d/2)). - Andrey Zabolotskiy, Jul 20 2019
a(n) = (A007503(n) + A183063(n))/2. - Peter Luschny, Jul 20 2019

Extensions

New description from Vladeta Jovovic, Feb 03 2003

A159842 Number of symmetrically-distinct supercells (sublattices) of the fcc and bcc lattices (n is the "volume factor" of the supercell).

Original entry on oeis.org

1, 2, 3, 7, 5, 10, 7, 20, 14, 18, 11, 41, 15, 28, 31, 58, 21, 60, 25, 77, 49, 54, 33, 144, 50, 72, 75, 123, 49, 158, 55, 177, 97, 112, 99, 268, 75, 136, 129, 286, 89, 268, 97, 249, 218, 190, 113, 496, 146, 280, 203, 333, 141, 421, 207, 476, 247, 290, 171, 735
Offset: 1

Views

Author

Gus Hart (gus_hart(AT)byu.edu), Apr 23 2009

Keywords

Comments

The number of fcc/bcc supercells (sublattices) as a function of n (volume factor) is equivalent to the sequence A001001. But many of these sublattices are symmetrically equivalent. The current sequence lists those that are symmetrically distinct.
Is this the same as A045790? - R. J. Mathar, Apr 28 2009
This sequence also gives number of sublattices of index n for the diamond structure - see Hanany, Orlando & Reffert, sec. 6.3 (they call it the tetrahedral lattice). Indeed: the diamond structure consists of two interpenetrating fcc lattices, and all sites of any sublattice should belong to the same fcc lattice because every sublattice is inversion-symmetric. - Andrey Zabolotskiy, Mar 18 2018

Crossrefs

Programs

  • Python
    def dc(f, *r): # Dirichlet convolution of multiple sequences
        if not r:
            return f
        return lambda n: sum(f(d)*dc(*r)(n//d) for d in range(1, n+1) if n%d == 0)
    def fin(*a): # finite sequence
        return lambda n: 0 if n > len(a) else a[n-1]
    def per(*a): # periodic sequences
        return lambda n: a[n%len(a)]
    u, N, N2 = lambda n: 1, lambda n: n, lambda n: n**2
    def a(n): # Hanany, Orlando & Reffert, sec. 6.3
        return (dc(u, N, N2)(n) + 9*dc(fin(1, -1, 0, 4), u, u, N)(n)
                + 8*dc(fin(1, 0, -1, 0, 0, 0, 0, 0, 3), u, u, per(0, 1, -1))(n)
                + 6*dc(fin(1, -1, 0, 2), u, u, per(0, 1, 0, -1))(n))//24
    print([a(n) for n in range(1, 300)])
    # Andrey Zabolotskiy, Mar 18 2018

Extensions

Terms a(20) and beyond from Andrey Zabolotskiy, Mar 18 2018

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

A145390 Number of sublattices of index n of a centered rectangular lattice fixed by a reflection.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Feb 23 2009, Mar 13 2009

Keywords

Comments

a(n) is the Dirichlet convolution of A000012 and A098178. - Domenico (domenicoo(AT)gmail.com), Oct 21 2009

Crossrefs

Cf. A098178, A060594 (primitive sublattices only), A145391.

Programs

  • Maple
    nmax := 100 :
    L := [1,-1,0,2,seq(0,i=1..nmax)] :
    MOBIUSi(%) :
    MOBIUSi(%) ; # R. J. Mathar, Sep 25 2017
  • Mathematica
    m = 101; Drop[ CoefficientList[ Series[ Sum[(1 + Cos[n*Pi/2])*x^n/(1 - x^n), {n, 1, m}], {x, 0, m}], x], 1] (* Jean-François Alcover, Sep 20 2011, after formula *)
    f[p_, e_] := e+1; f[2, e_] := 2*e-1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Aug 27 2023 *)
  • PARI
    t1=direuler(p=2,200,1/(1-X)^2)
    t2=direuler(p=2,2,1-X+2*X^2,200)
    t3=dirmul(t1,t2)

Formula

Dirichlet g.f.: (1-2^(-s) + 2*4^(-s))*zeta^2(s).
G.f.: Sum_n (1 + cos(n*Pi/2)) x^n / (1 - x^n). - Domenico (domenicoo(AT)gmail.com), Oct 21 2009
If 4|n then a(n) = d(n) - d(n/2) + 2*d(n/4); else if 2|n then a(n) = d(n) - d(n/2); else a(n) = d(n); where d(n) is the number of divisors of n. [Rutherford] - Andrey Zabolotskiy, Mar 10 2018
a(n) = Sum_{ m: m^2|n } A060594(n/m^2). - Andrey Zabolotskiy, May 07 2018
Sum_{k=1..n} a(k) ~ n*(log(n) - 1 + 2*gamma - log(2)/2), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Feb 02 2019
Multiplicative with a(2^e) = 2*e-1 and a(p^e) = e+1 for an odd prime p. - Amiram Eldar, Aug 27 2023

Extensions

New name from Andrey Zabolotskiy, Mar 10 2018

A157223 Number of primitive inequivalent oblique sublattices of centered rectangular lattice of index n.

Original entry on oeis.org

0, 1, 1, 2, 2, 5, 3, 4, 5, 8, 5, 10, 6, 11, 10, 10, 8, 17, 9, 16, 14, 17, 11, 20, 14, 20, 17, 22, 14, 34, 15, 22, 22, 26, 22, 34, 18, 29, 26, 32, 20, 46, 21, 34, 34, 35, 23, 44, 27, 44, 34, 40, 26, 53, 34, 44, 38, 44, 29, 68, 30, 47, 46, 46, 40, 70, 33, 52, 46
Offset: 1

Views

Author

N. J. A. Sloane, Feb 25 2009

Keywords

Crossrefs

Cf. A060594 (primitive mirror-symmetric sublattices), A145390 (all mirror-symmetric sublattices), A145391 (all sublattices), A001615, A304182.

Formula

a(n) = (A001615(n) - A060594(n))/2. - Andrey Zabolotskiy, May 09 2018

Extensions

New name and more terms from Andrey Zabolotskiy, May 09 2018
Showing 1-8 of 8 results.