OFFSET
2,1
COMMENTS
The triangle of numbers is:
....k....2....3.....4......5.......6........7
.n
.2.......2
.3.......8...16
.4......18...64...134
.5......34..170...706...1854
.6......60..398..2346..13198...41478
.7.....102..880..6832..55454..382116..1424988
The sequence is formed by reading the triangle by rows.
LINKS
FORMULA
Let T(n,k) denote an element of the triangle then the following recurrence relations appear to hold:
T(n, 2) - T(n-1, 2) - 2*A000045(n+1) = 0, n >= 3,
T(n, 3) - 2*T(n-1, 3) - T(n-4, 3) - 4*(n+11) = 0, n >= 7.
EXAMPLE
T(2,2) = The number of rotationally distinct complete non-self-adjacent simple path shapes within a 2 X 2 node rectangle.
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Christopher Hunt Gribble, Jun 07 2012
STATUS
approved