login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160849 Number of lines through at least 2 points of an 9 X n grid of points 0
0, 1, 83, 164, 299, 454, 673, 894, 1183, 1492, 1855, 2218, 2653, 3102, 3623, 4148, 4719, 5310, 5973, 6638, 7375, 8124, 8923, 9730, 10609, 11502, 12459, 13424, 14443, 15478, 16585, 17686, 18859, 20052, 21299, 22554, 23869, 25198, 26599, 28008 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

S. Mustonen, On lines and their intersection points in a rectangular grid of points

FORMULA

a(n)=(1/2)*(f(m,n,1)-f(m,n,2)) where f(m,n,k)=Sum((n-|kx|)*(m-|ky|)); -n<kx<n, -m<ky<m, (x,y)=1, m=9

For another more efficient formula, see Mathematica code below.

MATHEMATICA

m=9;

a[0]=0; a[1]=1;

a[2]=m^2+2;

a[3]=2*m^2+3-Mod[m, 2];

a[n_]:=a[n]=2*a[n-1]-a[n-2]+2*p1[m, n]+2*p4[m, n]

p1[m_, n_]:=Sum[p2[m, n, y], {y, 1, m-1}]

p2[m_, n_, y_]:=If[GCD[y, n-1]==1, m-y, 0]

p[i_]:=If[i>0, i, 0]

p2[m_, n_, x_, y_]:=p2[m, n, x, y]=(n-x)*(m-y)-p[n-2*x]*p[m-2*y]

p3[m_, n_, x_, y_]:=p2[m, n, x, y]-2*p2[m, n-1, x, y]+p2[m, n-2, x, y]

p4[m_, n_]:=p4[m, n]=If[Mod[n, 2]==0, 0, p42[m, n]]

p42[m_, n_]:=p42[m, n]=Sum[p43[m, n, y], {y, 1, m-1}]

p43[m_, n_, y_]:=If[GCD[(n-1)/2, y]==1, p3[m, n, (n-1)/2, y], 0]

Table[a[n], {n, 0, 39}]

CROSSREFS

Sequence in context: A142118 A044253 A044634 * A136079 A118359 A084866

Adjacent sequences:  A160846 A160847 A160848 * A160850 A160851 A160852

KEYWORD

nonn

AUTHOR

Seppo Mustonen (seppo.mustonen(AT)helsinki.fi), May 28 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 07:44 EST 2012. Contains 205597 sequences.