A261547
The 3 X 3 X … X 3 dots problem (3, n times): minimal number of straight lines (connected at their endpoints) required to pass through 3^n dots arranged in a 3 X 3 X … X 3 grid.
offset: 0
codomain: ℕ
Declarations
Section titled “Declarations”- A261547computable