A334474 T(n, k) is the number of steps from the point (0, 0) to the point (k, n) along the space filling curve T defined in Comments section; square array T(n, k), n, k >= 0 read by antidiagonals downwards.
0, 2, 1, 8, 3, 4, 9, 7, 6, 5, 31, 10, 11, 15, 16, 32, 30, 12, 14, 18, 17, 33, 29, 27, 13, 24, 19, 20, 35, 34, 28, 26, 25, 23, 22, 21, 121, 36, 37, 41, 42, 61, 62, 63, 64, 122, 120, 38, 40, 43, 44, 60, 59, 66, 65, 123, 119, 117, 39, 47, 46, 45, 58, 72, 67, 68
Offset: 0
Examples
Square array starts: n\k| 0 1 2 3 4 5 6 7 ---+------------------------- 0| 0 2 8--9 31-32-33 35 | | /| | | | | /| | |/ | | | | |/ | 1| 1 3 7 10 30-29 34 36 | / / / | / | / / / | / 2| 4 6 11-12 27-28 37-38 | | / | | | | |/ | | | 3| 5 15-14-13 26 41-40-39 | / / / | / / / 4| 16 18 24-25 42-43 47-48 | | /| | / / | | |/ | | / / | 5| 17 19 23 61 44 46 50-49 | / / /| | / | | / / / | |/ | 6| 20 22 62 60 45 56 51-52- | | / / / /|
Links
- Ideophilus, A triangular space-filling curve
- Rémy Sigrist, Colored representation of T_{2^10} (where the hue is function of the number of steps from the origin)
- Rémy Sigrist, Representation of T_{2^k} for k = 1..5
- Rémy Sigrist, PARI program for A334474
Programs
-
PARI
\\ See Links section.
Comments