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!)
A194134 Number of ways to arrange 6 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,1,244,6480,69798,496198,2595897,10912452,38739354,121694240,

%T 342722071,887407361,2136513884,4828507719,10332712952,21117591802,

%U 41392701372,78248425161,143087468105,253946607496,438734862156

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

%C Column 6 of A194136.

%H R. H. Hardin, <a href="/A194134/b194134.txt">Table of n, a(n) for n = 1..27</a>

%e Some solutions for 5 X 5 X 5:

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

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

%e ....1.0.0......0.0.0......1.0.0......1.0.1......0.1.1......0.0.1......0.0.0

%e ...0.0.1.0....0.1.1.0....0.1.0.1....1.0.1.0....0.1.0.0....1.0.0.0....1.0.0.1

%e ..0.1.1.0.0..0.0.1.0.1..0.1.0.1.0..0.0.0.1.0..0.0.1.0.1..0.1.0.1.0..0.1.0.1.0

%K nonn

%O 1,5

%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 24 15:39 EDT 2021. Contains 347643 sequences. (Running on oeis4.)