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 3; a(n) is the number of cells after n iterations.
A285397
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 3; a(n) is the number of cells after n iterations.
Terms
- a(0) =1a(1) =26a(2) =646a(3) =15818a(4) =385822a(5) =9401330a(6) =229023958a(7) =5578844858a(8) =135894050926
External references
- oeis: A285397