cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A194132 #8 Dec 09 2017 03:57:11
%S A194132 0,0,6,114,843,4122,14988,45414,119340,281442,608616,1228812,2338779,
%T A194132 4240284,7371414,12354156,20052846,31653108,48726846,73358964,
%U A194132 108233781,156793974,223400004,313529940,433929258,592922880,800651538,1069378740
%N 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.
%C A194132 Column 4 of A194136.
%H A194132 R. H. Hardin, <a href="/A194132/b194132.txt">Table of n, a(n) for n = 1..78</a>
%e A194132 All solutions for 3 X 3 X 3:
%e A194132 ....1......1......0......0......1......0
%e A194132 ...0.1....1.1....1.1....1.1....1.0....1.1
%e A194132 ..1.1.0..0.1.0..1.1.0..1.0.1..0.1.1..0.1.1
%K A194132 nonn
%O A194132 1,3
%A A194132 _R. H. Hardin_, Aug 17 2011