|
| |
|
|
A054398
|
|
Define a sequence of 2^n X 2^n squares as follows: S_0 = [1], S_1 = [1,2; 3,4]; S_2 = [1,2,5,6; 3,4,7,8; 9,10,13,14; 11,12,15,16], etc.; sequence gives triangular array whose n-th row gives differences between successive columns of n-th square.
|
|
0
| |
|
|
1, 1, 3, 1, 1, 3, 1, 11, 1, 3, 1, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 171, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 171, 1, 3, 1, 11, 1, 3, 1, 43, 1, 3, 1, 11, 1, 3, 1, 683, 1, 3, 1, 11
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| 1; 1,3,1; 1,3,1,11,1,3,1; ...
|
|
|
CROSSREFS
| Sequence in context: A122506 A010274 A137728 * A093415 A106749 A140216
Adjacent sequences: A054395 A054396 A054397 * A054399 A054400 A054401
|
|
|
KEYWORD
| nonn,tabf,easy,nice
|
|
|
AUTHOR
| Tidjani Negadi (t-negadi(AT)usa.net), May 21 2000
|
|
|
EXTENSIONS
| More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Sep 12 2001
|
| |
|
|
