A063179
Di-Boustrophedon transform of (1,0,0,0,...): Fill in an array by diagonals alternating in the 'up' and 'down' directions. The n-th diagonal starts with the n-th element of (1,0,0,0,...). When going in the 'up' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the row the new element is in. When going in the 'down' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the column the new element is in. The final element of the n-th diagonal is a(n).
| n |
a(n) |
| 1 |
1 |
| 2 |
1 |
| 3 |
2 |
| 4 |
4 |
| 5 |
12 |
| 6 |
42 |
| 7 |
178 |
| 8 |
870 |
| 9 |
4830 |
| 10 |
29976 |
| 11 |
205572 |
| 12 |
1543210 |
| 13 |
12583242 |
| 14 |
110725638 |
| 15 |
1045664646 |
| 16 |
10547679660 |
| 17 |
113172039256 |
| 18 |
1286925785286 |
| 19 |
15459448549274 |
| 20 |
195616259182162 |
| 21 |
2600506074185090 |
| 22 |
36235386548738016 |
| 23 |
528084808585261568 |
| 24 |
8033872923106040478 |
[1, 1, 2, 4, 12, 42, 178, 870, 4830, 29976, 205572, 1543210, 12583242, 110725638, 1045664646, 10547679660, 113172039256, 1286925785286, 15459448549274, 195616259182162, 2600506074185090, 36235386548738016, 528084808585261568, 8033872923106040478]