login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193155 Number of nXnXn triangular 0..1 arrays with each element equal to the sum mod 2 of two neighbors 1
0, 4, 8, 126, 3269, 169942, 17345573, 3495586809, 1389897952334, 1090163075958998, 1686816727834550231, 5148938004752209696533, 31005486113751088602024098, 368324363978199003012362844935 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..17

EXAMPLE

Some solutions for 4X4X4

.....0........1........0........0........0........1........1........1

....1.1......1.0......1.1......0.0......1.1......1.0......1.0......0.1

...0.1.0....1.0.0....0.0.0....1.1.1....1.1.0....0.1.0....0.1.1....1.0.0

..1.1.1.1..1.0.1.1..1.1.1.1..0.1.0.1..0.1.1.1..0.0.1.1..0.0.0.1..0.1.1.1

CROSSREFS

Sequence in context: A012940 A182967 A013049 * A060239 A127943 A012498

Adjacent sequences:  A193152 A193153 A193154 * A193156 A193157 A193158

KEYWORD

nonn

AUTHOR

R. H. Hardin Jul 16 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 13:33 EST 2019. Contains 329230 sequences. (Running on oeis4.)