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.

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.

This page as a plain text file.
%I A194134 #8 Dec 09 2017 19:45:57
%S A194134 0,0,0,1,244,6480,69798,496198,2595897,10912452,38739354,121694240,
%T A194134 342722071,887407361,2136513884,4828507719,10332712952,21117591802,
%U A194134 41392701372,78248425161,143087468105,253946607496,438734862156
%N 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.
%C A194134 Column 6 of A194136.
%H A194134 R. H. Hardin, <a href="/A194134/b194134.txt">Table of n, a(n) for n = 1..27</a>
%e A194134 Some solutions for 5 X 5 X 5:
%e A194134 ......1..........1..........1..........0..........0..........0..........0
%e A194134 .....0.1........1.0........0.0........0.1........1.0........1.1........1.1
%e A194134 ....1.0.0......0.0.0......1.0.0......1.0.1......0.1.1......0.0.1......0.0.0
%e A194134 ...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 A194134 ..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 A194134 nonn
%O A194134 1,5
%A A194134 _R. H. Hardin_, Aug 17 2011