login
This site is supported by donations to The OEIS 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
0, 0, 0, 1, 244, 6480, 69798, 496198, 2595897, 10912452, 38739354, 121694240, 342722071, 887407361, 2136513884, 4828507719, 10332712952, 21117591802, 41392701372, 78248425161, 143087468105, 253946607496, 438734862156 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Column 6 of A194136.

LINKS

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

EXAMPLE

Some solutions for 5 X 5 X 5:

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

.....0.1........1.0........0.0........0.1........1.0........1.1........1.1

....1.0.0......0.0.0......1.0.0......1.0.1......0.1.1......0.0.1......0.0.0

...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

..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

CROSSREFS

Sequence in context: A178266 A081864 A002594 * A085440 A218246 A217471

Adjacent sequences:  A194131 A194132 A194133 * A194135 A194136 A194137

KEYWORD

nonn

AUTHOR

R. H. Hardin, Aug 17 2011

STATUS

approved

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 14 12:45 EDT 2019. Contains 328006 sequences. (Running on oeis4.)