Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 0 or 3; a(n) is the number of cells after n iterations.

A285400

Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 0 or 3; a(n) is the number of cells after n iterations.

Terms

    a(0) =1a(1) =18a(2) =378a(3) =7938a(4) =166698a(5) =3500658a(6) =73513818a(7) =1543790178a(8) =32419593738a(9) =680811468498

External references