login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194133 Number of ways to arrange 5 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,0,39,792,7587,43836,194013,696765,2145687,5851044,14546412,

%T 33347130,71662911,145616964,281816991,522786390,935155011,1618729257,

%U 2722297371,4459330956,7133246976,11168002962,17149002624,25863493314,38369771853

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

%C Column 5 of A194136.

%H R. H. Hardin, <a href="/A194133/b194133.txt">Table of n, a(n) for n = 1..42</a>

%e Some solutions for 4 X 4 X 4:

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

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

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

%e ..1.0.1.0..0.1.0.1..1.0.1.0..0.1.0.1..0.1.0.0..1.0.0.1..1.0.1.0..0.1.0.1

%K nonn

%O 1,4

%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 September 21 20:10 EDT 2021. Contains 347598 sequences. (Running on oeis4.)