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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194190 Number of ways to arrange 5 indistinguishable points on an nXn square grid so that no three points are collinear at any angle 2
0, 0, 28, 1668, 25052, 215448, 1189868, 5199888, 18520572, 56978440, 155627304, 388897892, 894254904, 1932504496, 3945470564, 7669533756, 14291010972, 25694009628, 44662697948, 75451394832, 124066723008, 199190308172 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 5 of A194193

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..24

EXAMPLE

Some solutions for 3X3

..0..1..0....1..0..1....0..1..1....1..1..0....1..1..0....1..1..0....1..0..1

..0..1..1....1..1..0....1..0..0....1..0..1....1..0..0....0..0..1....1..0..0

..1..0..1....0..1..0....0..1..1....0..0..1....0..1..1....1..1..0....0..1..1

CROSSREFS

Sequence in context: A042512 A163033 A060335 * A190397 A004705 A182400

Adjacent sequences:  A194187 A194188 A194189 * A194191 A194192 A194193

KEYWORD

nonn

AUTHOR

R. H. Hardin Aug 18 2011

STATUS

approved

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

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

Last modified December 22 12:47 EST 2014. Contains 252356 sequences.