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

A119437 Table T(n,k) = number of lines through exactly k points of an n X n grid of points.

Original entry on oeis.org

6, 12, 8, 48, 4, 10, 108, 16, 4, 12, 248, 36, 4, 4, 14, 428, 64, 20, 4, 4, 16, 764, 100, 44, 4, 4, 4, 18, 1196, 204, 36, 24, 4, 4, 4, 20, 1900, 252, 64, 52, 4, 4, 4, 4, 22, 2668, 396, 124, 40, 28, 4, 4, 4, 4, 24, 3824, 572, 200, 20, 60, 4, 4, 4, 4, 4, 26, 5244, 780, 236, 76, 44, 32
Offset: 2

Views

Author

Keywords

Examples

			From _Seiichi Manyama_, Nov 26 2017: (Start)
The table starts:
  n\k|   2    3   4   5   6   7   8
  ---+------------------------------
   2 |   6;
   3 |  12,   8;
   4 |  48,   4, 10;
   5 | 108   16,  4, 12;
   6 | 248,  36,  4,  4, 14;
   7 | 428,  64, 20,  4,  4, 16;
   8 | 764, 100, 44,  4,  4,  4, 18; (End)
		

Crossrefs

Row sums A018808; columns A018809-A018817. See A119439 for another version.

Formula

T(n,k) = 1/2 (f(n, k+1) - 2 f(n, k) + f(n, k-1)) where f(n, k) = Sum_{-n < kx < n, -n < ky < n, gcd(x, y)=1} (n - |kx|)*(n - |ky|). [Seppo Mustonen, Apr 18 2009]

Extensions

An incorrect formula removed by Seppo Mustonen, Apr 25 2009

A119438 Number of sets of points determined by the intersection of a line with an n X n grid of points.

Original entry on oeis.org

1, 2, 11, 30, 79, 166, 343, 586, 1003, 1574, 2407, 3418, 4867, 6630, 9027, 11794, 15203, 19190, 24251, 29906, 36911, 44830, 54071, 64178, 76251, 89574, 105051, 121762, 140751, 161478, 185367, 210906, 240075, 271678, 306635, 343706, 384667
Offset: 0

Views

Author

Keywords

Comments

Each singleton point is determined by all but finitely many of the family of lines passing through that point and the empty set is determined by any randomly positioned line.

Crossrefs

Formula

a(n) = A018808(n) + n^2 + 1.

A333597 The number of unit cells intersected by the circumference of a circle centered on the origin with radius squared equal to the norm of the Gaussian integers A001481(n).

Original entry on oeis.org

0, 4, 8, 12, 12, 16, 20, 20, 20, 28, 28, 32, 28, 28, 36, 36, 40, 36, 44, 44, 44, 44, 44, 52, 48, 52, 52, 52, 52, 60, 52, 60, 64, 60, 60, 60, 68, 68, 60, 68, 68, 68, 72, 68, 76, 76, 76, 76, 76, 76, 76, 84, 84, 76, 88, 76, 84, 84, 92, 84, 92
Offset: 1

Views

Author

Scott R. Shannon, Mar 28 2020

Keywords

Comments

Draw a circle on a 2D square grid centered at the origin with a radius squared equal to the norm of the Gaussian integers A001481(n). See the images in the links. This sequence gives the number of unit cells intersected by the circumference of the circle. Equivalently this is the number of intersections of the circumference with the x and y integer grid lines.

Crossrefs

Cf. A001481, A055025, A057655, A119439, A242118 (a subsequence of this sequence), A234300.

Formula

a(n) = 4*A234300(2*(n-1)). - Andrey Zabolotskiy, Feb 22 2025
Showing 1-3 of 3 results.