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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Mar 31 2012 12:36:20
%S 0,0,9,125,3176,158062,15473372,2981756708,1131238674764,
%T 844937235946974,1242458005388315094,3596882436029100961276,
%U 20500197685375360012821575,230026108495284153905216078860,5081401276365121365697869509141767
%N Number of nXnXn triangular 0..1 arrays with each element equal to at least one neighbor, containing at least one 1 and with new values 0..1 introduced in row major order
%H R. H. Hardin, <a href="/A192724/b192724.txt">Table of n, a(n) for n = 1..17</a>
%e All solutions for 3X3X3
%e ....0......0......0......0......0......0......0......0......0
%e ...0.0....0.1....0.1....0.0....1.0....1.0....1.0....0.1....0.0
%e ..0.1.1..0.1.1..1.1.1..1.1.0..1.0.0..1.1.1..1.1.0..0.0.1..1.1.1
%K nonn
%O 1,3
%A _R. H. Hardin_ Jul 08 2011