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!)
 A183271 Half the number of nXnXn triangular binary arrays with the number of 0-0 adjacencies equal to the number of 1-1 adjacencies 1

%I #6 Mar 31 2012 12:35:50

%S 1,0,0,65,1578,0,0,1875535329,839252581538,0,0,5227844810759073967200,

%T 39228698077486633860579435,0,0,

%U 1102249786277252805957700361396650437576,135380785027014267422923708062639569342712090,0,0

%N Half the number of nXnXn triangular binary arrays with the number of 0-0 adjacencies equal to the number of 1-1 adjacencies

%C a(n)=0 for n mod 4 = 2 or 3 because the number of edges is odd and flipping a 0 to a 1 changes the relative counts by an even number

%H R. H. Hardin, <a href="/A183271/b183271.txt">Table of n, a(n) for n = 1..59</a>

%e Some solutions for 4X4X4 with a(1,1)=0 and equal 0-0 and 1-1 adjacencies

%e .....0........0........0........0........0........0........0........0

%e ....1.0......1.0......0.0......1.0......1.1......1.0......0.1......1.1

%e ...1.0.0....1.0.0....1.0.1....1.0.1....0.1.1....0.0.1....1.0.1....0.0.0

%e ..1.1.1.0..0.1.1.1..0.1.1.1..1.1.0.0..0.0.0.0..0.1.1.1..0.1.0.1..1.1.1.0

%K nonn

%O 1,4

%A _R. H. Hardin_ Jan 03 2011

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 9 19:52 EST 2023. Contains 367693 sequences. (Running on oeis4.)