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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194479 Number of ways to arrange 7 indistinguishable points on an n X n X n triangular grid so that no three points are in the same row or diagonal. 1
 0, 0, 0, 0, 15, 3525, 98473, 1237434, 9821400, 57367112, 268378248, 1059987987, 3661533037, 11341971885, 32090198922, 84099053568, 206386405560, 478423135296, 1054963957500, 2225704950054, 4514320792971, 8838377453829 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Column 7 of A194480. LINKS R. H. Hardin, Table of n, a(n) for n = 1..24 EXAMPLE Some solutions for 5 X 5 X 5: ......0..........0..........1..........0..........0..........1..........1 .....1.0........0.1........0.0........1.0........0.1........0.0........0.0 ....0.1.1......1.1.0......1.0.1......1.0.1......1.0.1......1.1.0......0.1.1 ...1.0.0.1....1.0.0.1....0.1.1.0....0.1.1.0....1.0.1.0....0.0.1.1....1.1.0.0 ..0.1.1.0.0..0.0.1.1.0..0.1.0.1.0..0.1.0.0.1..0.1.0.1.0..0.1.1.0.0..0.0.1.1.0 CROSSREFS Sequence in context: A230672 A145189 A182283 * A262019 A153832 A198524 Adjacent sequences:  A194476 A194477 A194478 * A194480 A194481 A194482 KEYWORD nonn AUTHOR R. H. Hardin, Aug 26 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 December 4 17:50 EST 2021. Contains 349526 sequences. (Running on oeis4.)