The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329501 Array read by upward antidiagonals: row n = coordination sequence for cylinder formed by rolling up a strip of width n squares cut from the square grid by cuts parallel to grid lines. 7
 1, 1, 2, 1, 3, 2, 1, 4, 4, 2, 1, 4, 6, 4, 2, 1, 4, 7, 6, 4, 2, 1, 4, 8, 8, 6, 4, 2, 1, 4, 8, 10, 8, 6, 4, 2, 1, 4, 8, 11, 10, 8, 6, 4, 2, 1, 4, 8, 12, 12, 10, 8, 6, 4, 2, 1, 4, 8, 12, 14, 12, 10, 8, 6, 4, 2 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS For the case when the cuts are at 45 degrees to the grid lines, see A329504. See A329508, A329512, and A329515 for coordination sequences for cylinders formed by rolling up the hexagonal grid ("carbon nanotubes"). The g.f.s for the rows can easily be found using the "trunks and branches" method (see Goodman-Strauss and Sloane). In the illustration for n=5, there are two trunks (blue) and ten branches (red). LINKS Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also arXiv:1803.08530. N. J. A. Sloane, Illustration for rows 1 through 5, showing vertices of cylinder labeled with distance from base point (c = n is the width (or circumference)). The cylinders are formed by identifying the black lines. FORMULA Let theta = (1+x)/(1-x). If n = 2*k, the g.f. for the coordination sequence for row n is theta*(1+2*x+2*x^2+...+2*x^(k-1)+x^k). If n = 2*k+1, the g.f. for the coordination sequence for row n is theta*(1+2*x+2*x^2+...+2*x^k). EXAMPLE Array begins: 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ... 1, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, ... 1, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, ... 1, 4, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, ... 1, 4, 8, 10, 10, 10, 10, 10, 10, 10, 10, 10, ... 1, 4, 8, 11, 12, 12, 12, 12, 12, 12, 12, 12, ... 1, 4, 8, 12, 14, 14, 14, 14, 14, 14, 14, 14, ... 1, 4, 8, 12, 15, 16, 16, 16, 16, 16, 16, 16, ... 1, 4, 8, 12, 16, 18, 18, 18, 18, 18, 18, 18, ... 1, 4, 8, 12, 16, 19, 20, 20, 20, 20, 20, 20, ... ... The initial antidiagonals are: 1; 1, 2; 1, 3, 2; 1, 4, 4, 2; 1, 4, 6, 4, 2; 1, 4, 7, 6, 4, 2; 1, 4, 8, 8, 6, 4, 2; 1, 4, 8, 10, 8, 6, 4, 2; 1, 4, 8, 11, 10, 8, 6, 4, 2; 1, 4, 8, 12, 12, 10, 8, 6, 4, 2; 1, 4, 8, 12, 14, 12, 10, 8, 6, 4, 2; ... CROSSREFS Rows 1,2,3,4,5 are A040000, A113311, A329502, A115291, A329503. Cf. A008574, A329504-A329517. Sequence in context: A064881 A131967 A358120 * A300670 A355474 A137679 Adjacent sequences: A329498 A329499 A329500 * A329502 A329503 A329504 KEYWORD nonn,tabl,easy AUTHOR N. J. A. Sloane, Nov 19 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 15:27 EST 2022. Contains 358588 sequences. (Running on oeis4.)