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

A321014 Number of divisors of n which are greater than 3.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 4, 2, 2, 1, 5, 2, 2, 2, 4, 1, 5, 1, 4, 2, 2, 3, 6, 1, 2, 2, 6, 1, 5, 1, 4, 4, 2, 1, 7, 2, 4, 2, 4, 1, 5, 3, 6, 2, 2, 1, 9, 1, 2, 4, 5, 3, 5, 1, 4, 2, 6, 1, 9, 1, 2, 4, 4, 3, 5, 1, 8, 3, 2, 1, 9, 3, 2, 2, 6, 1, 9, 3, 4, 2, 2
Offset: 1

Views

Author

N. J. A. Sloane, Nov 04 2018

Keywords

References

  • Marjorie Senechal, "Introduction to lattice geometry." In M. Waldschmidt et al., eds., From Number Theory to Physics, pp. 476-495. Springer, Berlin, Heidelberg, 1992. See Cor. 3.7.

Crossrefs

A072527 is a shifted version.
Column k=4 of A135539.

Programs

  • Maple
    d2:=proc(n) local c;
    if n <= 3 then return(0); fi;
    c:=NumberTheory[tau](n)-1;
    if (n mod 2)=0 then c:=c-1; fi;
    if (n mod 3)=0 then c:=c-1; fi; c; end;
    [seq(d2(n),n=1..120)];
  • Mathematica
    nmax = 94; Rest[CoefficientList[Series[Sum[x^k/(1 - x^k), {k, 4, nmax}], {x, 0, nmax}], x]] (* Ilya Gutkovskiy, Nov 07 2018 *)
  • PARI
    a(n) = sumdiv(n, d, d>3); \\ Michel Marcus, Nov 06 2018
    
  • PARI
    a(n) = numdiv(n) - 3 + !!(n%2) + !!(n%3) \\ David A. Corneth, Nov 07 2018
    
  • PARI
    my(N=100, x='x+O('x^N)); concat([0, 0, 0], Vec(sum(k=1, N, x^(4*k)/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023

Formula

G.f.: Sum_{k>=4} x^k/(1 - x^k). - Ilya Gutkovskiy, Nov 06 2018
a(n) = Sum_{d|n, d>3} 1. - Wesley Ivan Hurt, Apr 28 2020
G.f.: Sum_{k>=1} x^(4*k)/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 17/6), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024

A071880 Number of combinatorial types of n-dimensional parallelohedra.

Original entry on oeis.org

1, 1, 2, 5, 52, 103769
Offset: 0

Views

Author

N. J. A. Sloane, Jun 10 2002

Keywords

Comments

a(n) is the number of topologically distinct shapes the Voronoi cell (or Vocell) of an n-dimensional lattice can have.
a(n) is the number of combinatorially distinct parallelotopes that tile R^n. Dirichlet proved a(2) = 2, Fedorov showed a(3) = 5, while a(4) = 52 is due to Delone as corrected by Stogrin, and a(5) = 103769 to Engel. - Jonathan Sondow, May 26 2017
The papers by Dutuor Sikiric, Garber et al say that actually a(5) = 110244. The claim that every parallelotope is a Voronoi cell of some lattice in R^n up to an affine transformation is a conjecture open for n > 5. - Andrey Zabolotskiy, Feb 20 2021

Examples

			In 1 dimension: the Vocell is an interval (1 possible shape)
In 2 dimensions: a hexagon or rectangle (2 possible shapes)
In 3 dimensions: truncated octahedron, hexarhombic dodecahedron, rhombic dodecahedron, hexagonal prism, cuboid (5 possible shapes)
		

References

  • J. H. Conway, The Sensual Quadratic Form.
  • E. S. Fedorov, An Introduction to the Theory of Figures. Notices of the Imperial Petersburg Mineralogical Society, 2nd series, vol. 21, 1-279, 1885. (English translation in Symmetry of crystals, ACA Monograph no. 7, 50-131, 1971.)

Crossrefs

Extensions

Corrected by J. H. Conway, Dec 25 2003
Showing 1-2 of 2 results.