cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A223093 Number of foldings of n labeled stamps in which leaf 1 is inwards and leaf n outwards (or leaf 1 outwards and leaf n inwards).

Original entry on oeis.org

0, 0, 2, 4, 16, 38, 132, 342, 1144, 3134, 10370, 29526, 97458, 285458, 942920, 2822310, 9341008, 28440970, 94358558, 291294678, 968853072, 3025232480, 10086634316, 31797822936, 106265437078, 337731551446, 1131117792978, 3620119437762, 12148796744234, 39118879440938
Offset: 1

Views

Author

N. J. A. Sloane, Mar 29 2013

Keywords

Comments

Subset of foldings of n labeled stamps (A000136). - Stéphane Legendre, Apr 09 2013

Programs

Formula

a(n) = A000682(n+1) - A077014(n). - Andrew Howroyd, Dec 06 2015
A217310(n) = 2*a(n) if n is odd and A217310(n) = a(n) if n is even. - Stéphane Legendre, Jan 09 2014

Extensions

Name clarified by Stéphane Legendre, Apr 09 2013
More terms from Stéphane Legendre, Apr 09 2013

A227167 The number of meandering curves of order n.

Original entry on oeis.org

1, 1, 6, 8, 50, 72, 462, 696, 4536, 7030, 46310, 73188, 485914, 778946, 5202690, 8430992, 56579196, 92470194, 622945970, 1025114180, 6927964218, 11465054942, 77692142980, 129180293184, 877395996200, 1464716085664, 9968202968958, 16698145444260, 113837957337750, 191264779292430
Offset: 1

Views

Author

Keywords

Comments

A meandering curve of order n is a continuous curve which does not intersect itself yet intersects a horizontal line n times.
The set of meandering curves of order n is partitioned into the following three classes: curves with no extremities (A005316), curves with only one extremity (A217310), and curves with both extremities covered by their arcs (A217318).

References

  • A. Panayotopoulos and P. Tsikouras, Properties of meanders, JCMCC 46 (2003), 181-190.

Programs

Formula

a(n) = A000136(n) if n is odd and a(n) = (1/2)*A000136(n) if n is even.
a(n) = A217310(n) + A217318(n) + A005316(n). - Andrew Howroyd, Dec 07 2015
Showing 1-2 of 2 results.