3500658

Appears in sequences

• 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.at n=5A285400
• Nonsquare numbers k such that tau(sigma(tau(k))) = sigma(tau(sigma(k))), where tau is A000005 and sigma is A000203.at n=1A355707
• Triangle read by rows: T(n, k) = n^k * Sum_{j=0..n} binomial(n - j, n - k) * Eulerian1(n, j).at n=31A372311