|
Search: id:A079409
|
|
|
| A079409 |
|
Array T(m,n) (m>=0, n>=0) read by antidiagonals: T(0, 0) = 1, T(0, n) = 0 if n > 0, T(m, n) = T(m-1, n - T(m-1, n)) + T(m-1, n - T(m-1, n-1)) if m > 0. |
|
+0
2
|
|
| 1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 1, 1, 0, 0, 1, 2, 3, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 2, 3, 4, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 0, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
This two-dimensional array is to Pascal's triangle as the Hofstadter Q-sequence A005185 is to Fibonacci's sequence.
Unlike the Hofstadter Q-sequence, it is very regular and admits a simple closed form: T(m, n) = 0 if n > m, T(m, n) = 1 if n <= m and m - n is even, T(m, n) = n + 1 if n <= m and m - n is odd.
|
|
EXAMPLE
|
For 0 <= m <= 6 and 0 <= n <= 6, the array looks like:
1,0,0,0,0,0,0
1,1,0,0,0,0,0
1,2,1,0,0,0,0
1,1,3,1,0,0,0
1,2,1,4,1,0,0
1,1,3,1,5,1,0
1,2,1,4,1,6,1
|
|
CROSSREFS
|
Cf. A004001, A005185, A007318, A052553, A079408.
Sequence in context: A064559 A067255 A065716 this_sequence A114643 A038498 A060952
Adjacent sequences: A079406 A079407 A079408 this_sequence A079410 A079411 A079412
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Rob Arthan (rda(AT)lemma-one.com), Jan 06 2003
|
|
|
Search completed in 0.002 seconds
|
