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-3 of 3 results.

A309504 Number of cyclic permutations of length n avoiding the pattern 123.

Original entry on oeis.org

1, 1, 1, 2, 4, 10, 24, 68, 188, 586, 1722, 5492, 16924, 55582, 177278, 594460, 1944980, 6628384, 22132112, 76421498, 259359036, 905416294, 3114033930, 10971347070, 38157201530
Offset: 0

Views

Author

Miklos Bona, Aug 05 2019

Keywords

Examples

			For n=3, there are two such permutations, 231 and 312.
The a(4) = 4 permutations are: 2413, 3142, 3421, 4312.
The a(5) = 10 permutations are: 25413, 35214, 35421, 41532, 43152, 43521, 45231, 53412, 54132, 54213.
		

Crossrefs

Cf. A000108 (number of permutations avoiding 123).

Programs

  • PARI
    \\ See Links for program code.
    for(n=0, 16, print1(E123(n), ", ")) \\ Andrew Howroyd, Nov 20 2024

Extensions

a(0)=1 prepended and a(13)-a(24) from Andrew Howroyd, Nov 17 2024

A309506 Number of cyclic permutations of length n avoiding the pattern 231 (equivalently, 312).

Original entry on oeis.org

1, 1, 1, 1, 2, 5, 12, 30, 86, 253, 748, 2274, 7152, 22890, 74189, 243342, 808599, 2716549, 9213420, 31498358, 108483093, 376145636, 1312463081, 4605569378, 16245866825
Offset: 0

Views

Author

Miklos Bona, Aug 05 2019

Keywords

Examples

			For n=4, there are two such permutations, 4123 and 4312.
The a(5) = 5 permutations are 51234, 51423, 53124, 54132, 54213.
		

Crossrefs

Cf. A000108 (number of permutations avoiding 231).

Programs

  • PARI
    \\ See PARI link in A309504 for program code.
    for(n=0, 16, print1(E231(n), ", ")) \\ Andrew Howroyd, Nov 20 2024

Extensions

a(1)=1 (confirmed by author) inserted by Alexander Burstein, Jul 20 2020
a(0)=1 prepended and a(13)-a(24) from Andrew Howroyd, Nov 20 2024

A309508 Number of cyclic permutations of length n avoiding the pattern 321.

Original entry on oeis.org

1, 1, 1, 2, 4, 10, 24, 66, 178, 512, 1486, 4446, 13468, 41648, 130178, 412670, 1321418, 4274970, 13948966, 45890440, 152061154, 507292698, 1702753462, 5748085332, 19506240462
Offset: 0

Views

Author

Miklos Bona, Aug 05 2019

Keywords

Comments

Comment from F. Chapoton, Sep 14 2021: (Start)
The maps sending a permutation to its inverse or to its reverse-complement define two commuting involutions on these sets of permutations.
The next terms in the sequence could be 41648, 130178, though these are counting Dyck words such that an associated permutation is cyclic, related but not obviously equivalent combinatorial objects. (End)

Examples

			For n=3, there are two such permutations, 231 and 312.
The a(4) = 4 permutations are: 2341, 2413, 3142, 4123.
The a(5) = 10 permutations are: 23451, 23514, 24153, 25134, 31452, 31524, 34512, 41253, 45123, 51234.
		

Crossrefs

Cf. A000108 (number of permutations avoiding 321).

Programs

  • PARI
    \\ See PARI link in A309504 for program code.
    for(n=0, 16, print1(E321(n), ", ")) \\ Andrew Howroyd, Nov 20 2024

Extensions

a(0)=1 prepended and a(13)-a(24) from Andrew Howroyd, Nov 17 2024
Showing 1-3 of 3 results.