A256260 Total number of ON states after n generations of a cellular automaton-like on the square grid.
1, 5, 9, 21, 25, 37, 57, 85, 89, 101, 121, 149, 169, 213, 281, 341, 345, 357, 377, 405, 425, 469, 537, 597, 617, 661, 729, 821, 937, 1077, 1241, 1365, 1369, 1381, 1401, 1429, 1449, 1493, 1561, 1621, 1641, 1685, 1753, 1845, 1961, 2101, 2265, 2389, 2409, 2453, 2521, 2613, 2729, 2869, 3033, 3221, 3433, 3669, 3929, 4213, 4521, 4853, 5209, 5461
Offset: 1
Examples
Written as an irregular triangle T(j,k), k>=1, in which the row lengths are the terms of A011782, the sequence begins: 1; 5; 9, 21; 25, 37, 57, 85; 89, 101,121,149,169,213,281,341; 345,357,377,405,425,469,537,597,617,661,729,821,937,1077,1241,1365; ... The right border gives the positive terms of A002450. It appears that this triangle at least shares with the triangles from the following sequences; A147562, A162795, A169707, A255366, A256250, the positive elements of the columns k, if k is a power of 2.
Links
Crossrefs
Formula
a(n) = 1 + 4*A256264(n-1).
Comments