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

 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
 0, 0, 6, 114, 843, 4122, 14988, 45414, 119340, 281442, 608616, 1228812, 2338779, 4240284, 7371414, 12354156, 20052846, 31653108, 48726846, 73358964, 108233781, 156793974, 223400004, 313529940, 433929258, 592922880, 800651538, 1069378740 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Column 4 of A194136. LINKS R. H. Hardin, Table of n, a(n) for n = 1..78 EXAMPLE All solutions for 3 X 3 X 3: ....1......1......0......0......1......0 ...0.1....1.1....1.1....1.1....1.0....1.1 ..1.1.0..0.1.0..1.1.0..1.0.1..0.1.1..0.1.1 CROSSREFS Sequence in context: A066931 A324669 A051228 * A194476 A059116 A121544 Adjacent sequences:  A194129 A194130 A194131 * A194133 A194134 A194135 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.

Last modified June 14 15:44 EDT 2021. Contains 345025 sequences. (Running on oeis4.)