|
Search: id:A092543
|
|
|
| A092543 |
|
Table below read by antidiagonals alternately upwards and downwards. |
|
+0
2
|
|
| 1, 2, 1, 1, 2, 3, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 13, 12, 11, 10, 9, 8
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
1 2 3 4 5 ...
1 2 3 4 5 ...
1 2 3 4 5 ...
1 2 3 4 5 ...
...
Let A be sequence A092543 (this sequence) and B be sequence A092542 (1, 1, 2, 3, 2, 1, 1, ...). Under upper trimming or lower trimming, A transforms into B, and B transforms into A. Also, B gives the number of times each element of A appears. For example, A(4) = 1 and B(4) = 3 because the 1 in A(4) is the third 1 to appear in A. - Kerry Mitchell (lkmitch(AT)gmail.com), Dec 28 2005
|
|
REFERENCES
|
Amir D. Aczel, "The Mystery of the Aleph, Mathematics, the Kabbalah, and the Search for Infinity", Barnes & Noble, NY 2000, page 112.
|
|
FORMULA
|
T(r,c)=c.
|
|
MATHEMATICA
|
Table[ Join[Range[2n], Reverse@Range[2n - 1]], {n, 7}] // Flatten (* Robert G. Wilson v Sep 28 2006 *)
|
|
CROSSREFS
|
Cf. A092542.
Sequence in context: A073725 A055223 A054482 this_sequence A090282 A022910 A030737
Adjacent sequences: A092540 A092541 A092542 this_sequence A092544 A092545 A092546
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Sam Alexander (amnalexander(AT)yahoo.com), Feb 27 2004
|
|
|
Search completed in 0.002 seconds
|
