The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183273 Half the number of nXnXn triangular binary arrays with the number of 0-0 adjacencies differing from the number of 1-1 adjacencies by one or less 1
 1, 3, 12, 65, 1578, 160098, 17065221, 1875535329, 839252581538, 1524001061360475, 2807101769922368808, 5227844810759073967200, 39228698077486633860579435, 1184998883345176952277627211488, 36038790171982413365368096113544968 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Counts will differ by one when n mod 4 = 2 or 3 LINKS R. H. Hardin, Table of n, a(n) for n = 1..52 EXAMPLE All solutions for 3X3X3 with a(1,1)=0 and 0-0 and 1-1 adjacencies differing by 1 or less ....0......0......0......0......0......0......0......0......0......0......0......0 ...1.1....0.0....0.1....0.1....1.1....1.0....1.0....1.0....1.0....0.1....1.1....0.1 ..0.0.0..1.1.1..1.1.0..0.1.0..1.0.0..1.0.1..1.1.0..0.1.1..0.1.0..0.1.1..0.0.1..1.0.1 CROSSREFS Sequence in context: A242575 A144297 A007017 * A082987 A086836 A074513 Adjacent sequences: A183270 A183271 A183272 * A183274 A183275 A183276 KEYWORD nonn AUTHOR R. H. Hardin Jan 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 09:11 EST 2023. Contains 367701 sequences. (Running on oeis4.)