A306288 - OEIS

A306288

Irregular triangle T(n,k), 1 <= n, 1 <= k <= (2/3)*(2+2^(2*n)), read by rows: T(n,k) determines absolute directions along the perimeter of the n-th T-type Hilbert Tree.

3, 0, 1, 2, 3, 3, 2, 3, 0, 0, 0, 1, 2, 1, 1, 2, 3, 3, 2, 3, 0, 3, 3, 2, 1, 2, 2, 3, 0, 3, 2, 3, 0, 0, 1, 0, 3, 0, 1, 0, 3, 0, 0, 1, 2, 1, 0, 1, 2, 2, 3, 2, 1, 1, 0, 1, 2, 1, 1, 2, 3, 3, 2, 3, 0, 3, 3, 2, 1, 2, 2, 3, 0, 3, 2, 3, 0, 0, 1, 0, 3, 3, 2, 3, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The T-type Hilbert trees are a sequence of polyominoes whose edges, all but one, are segments of the Hilbert curve described by A163540. One extra edge closes a loop around the perimeter (cf. Formula). The first T-type tree is a monomino with four edges, and the second is the T pentomino with 12 unit edges. All deeper trees are determined by iteration of replacement rules (cf. linked image "First Six T-type Trees"). The T-type Hilbert trees nest along the upper half plane according to the limit-periodic ruler function A001511. Such an arrangement reconstructs the Hilbert curve everywhere away from the ground axis (cf. linked image "Limit-Periodic Construction").

LINKS

Table of n, a(n) for n=1..85.

Bradley Klee, Limit-Periodic Construction.

Bradley Klee, First Six T-type Trees.

FORMULA

a(n,(2/3)*(2+2^(2*n))) = 2;

a(n,k) = A163540( (1/3)*(1+11*2^(2*n)+3*(-1)^n *2^(2*n+1))-1+k ).

EXAMPLE

T(1,k) = 3, 0, 1, 2;

T(2,k) = 3, 3, 2, 3, 0, 0, 0, 1, 2, 1, 1, 2.

MATHEMATICA

HC = {L[n_ /; EvenQ[n]] :> {F[n], L[n], L[Mod[n + 1, 2]], R[n]},