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

A285392

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

Terms

    a(0) =1a(1) =5a(2) =36a(3) =264a(4) =1944a(5) =14328a(6) =105624a(7) =778680a(8) =5740632a(9) =42321528a(10) =312006168a(11) =2300197176a(12) =16957700568a(13) =125016939000a(14) =921660044184

External references