|
Search: id:A058257
|
|
|
| A058257 |
|
Triangle read by rows: this is a variant of A008280 in which 2 rows go from left to right, 2 from right to left, 2 from left to right, etc. |
|
+0
4
|
|
| 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 3, 2, 1, 0, 0, 0, 3, 5, 6, 6, 6, 0, 0, 3, 8, 14, 20, 26, 71, 71, 71, 68, 60, 46, 26, 0, 413, 342, 271, 200, 132, 72, 26, 0, 0, 0, 413, 755, 1026, 1226, 1358, 1430, 1456, 1456, 1456, 0, 0, 413, 1168, 2194, 3420, 4778, 6208, 7664, 9120, 10576
(list; table; graph; listen)
|
|
|
OFFSET
|
0,11
|
|
|
COMMENT
|
Suggested by first Atkinson reference.
|
|
REFERENCES
|
M. D. Atkinson: Zigzag permutations and comparisons of adjacent elements, Information Processing Letters 21 (1985), 187-189.
M. D. Atkinson: Partial orders and comparison problems, Sixteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, (Boca Raton, Feb 1985), Congressus Numerantium 47, 77-88.
|
|
LINKS
|
J. Millar, N. J. A. Sloane and N. E. Young, A new operation on sequences: the Boustrophedon on transform, J. Combin. Theory, 17A 44-54 1996 (Abstract, pdf, ps).
Index entries for sequences related to boustrophedon transform
|
|
EXAMPLE
|
1; 0,1; 0,0,1; 1,1,1,0; 3,2,1,0,0; 0,3,5,6,6,6; ...
1
|
|
CROSSREFS
|
Cf. A058258, A008280, A000111.
Adjacent sequences: A058254 A058255 A058256 this_sequence A058258 A058259 A058260
Sequence in context: A111541 A105629 A085075 this_sequence A083199 A021761 A071960
|
|
KEYWORD
|
nonn,easy,tabl,nice
|
|
AUTHOR
|
njas, Dec 06 2000
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Dec 12 2000
|
|
|
Search completed in 0.002 seconds
|
