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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194132 Number of ways to arrange 4 indistinguishable points on an n X n X n triangular grid so that no three points are collinear at any angle. 2

%I

%S 0,0,6,114,843,4122,14988,45414,119340,281442,608616,1228812,2338779,

%T 4240284,7371414,12354156,20052846,31653108,48726846,73358964,

%U 108233781,156793974,223400004,313529940,433929258,592922880,800651538,1069378740

%N Number of ways to arrange 4 indistinguishable points on an n X n X n triangular grid so that no three points are collinear at any angle.

%C Column 4 of A194136.

%H R. H. Hardin, <a href="/A194132/b194132.txt">Table of n, a(n) for n = 1..78</a>

%e All solutions for 3 X 3 X 3:

%e ....1......1......0......0......1......0

%e ...0.1....1.1....1.1....1.1....1.0....1.1

%e ..1.1.0..0.1.0..1.1.0..1.0.1..0.1.1..0.1.1

%K nonn

%O 1,3

%A _R. H. Hardin_, Aug 17 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)