A165964 -id:A165964 - cp's OEIS frontend

A078628 Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).

1, 1, 0, 4, 12, 76, 494, 3662, 30574, 284398, 2918924, 32791604, 400400062, 5281683678, 74866857910, 1135063409918, 18330526475060, 314169905117860, 5695984717957246, 108921059813769710, 2190998123920252622, 46250325111346491694

Offset: 1

N. J. A. Sloane, Dec 12 2002

nonn

This sequence can be related to A165964 by the use of auxiliary sequences (and the auxiliary sequences can themselves be calculated by recurrence relations). So if we desire we can determine any value of this sequence. [From Isaac Lambert, Oct 07 2009]

			a(4) = 4: 4 2 1 3, 4 3 1 2, 4 1 3 2, 4 2 3 1.
a(5) = 12: 5 3 1 2 4, 5 2 3 1 4, 5 4 2 1 3, 5 2 4 1 3, 5 1 4 2 3, 5 2 1 4 3, 5 1 3 4 2, 5 3 1 4 2, 5 4 1 3 2, 5 3 4 1 2, 5 2 4 3 1, 5 3 2 4 1.

Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012. - From N. J. A. Sloane, Sep 14 2012

Isaac Lambert, Table of n, a(n) for n = 1..50
Wayne M. Dymáček and Isaac Lambert, Circular Permutations Avoiding Runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011), Article 11.1.6.
Sean A. Irvine, Java program (github)
N. J. A. Sloane, FORTRAN program
Index entries for sequences related to shoe lacings

Cf. A078673. See A002816, A078603 for analogous sequence with restrictions only on pairs.

Cf. A095816, A165963, A165964.

a(11)-a(13) from John W. Layman, Nov 15 2004

a(14) from Isaac Lambert, Oct 07 2009

A095816 Number of permutations of 1..n with no three elements in correct or reverse order.

Original entry on oeis.org

1, 1, 2, 4, 18, 92, 570, 4082, 33292, 304490, 3086890, 34357812, 416526730, 5463479106, 77094352076, 1164544912938, 18749754351338, 320544941916628, 5799226664694602, 110695180631374114, 2223242026407894732, 46868311165318977130, 1034758905785710599402

Offset: 0

Jonas Wallgren, Jun 08 2004

nonn

Counts permutations with the property that no subsequence i(i+1)(i+2) or (i+2)(i+1)i occurs.

Andrew Howroyd, Table of n, a(n) for n = 0..200
W. M. Dymacek and I. Lambert, Permutations Avoiding Runs of i, i+1, i+2 or i, i-1, i-2, J. Int. Seq. 14 (2011) # 11.1.6, Table 1.
D. M. Jackson and R. C. Read, A note on permutations without runs of given length, Aequationes Math. 17 (1978), no. 2-3, 336-343.

Cf. A002464, A095817, A095818.

Cf. A165963, A165964, A078628. [From Isaac Lambert, Oct 07 2009]

seq(n)={my(m=3); Vec(sum(k=0, n, k!*((2*x^m-x^(m+1)-x)/(x^m-1) + O(x*x^n))^k))} \\ Andrew Howroyd, Aug 31 2018

G.f. Sum_{n>=0} n!*((2*x^m-x^(m+1)-x)/(x^m-1))^n where m = 3. - Ivana Jovovic ( ivana121(AT)EUnet.yu ), Nov 11 2007
From Vaclav Kotesovec, May 26 2023: (Start)
a(n) ~ n! * (1 - 2/n + 6/n^2 - 28/(3*n^3) - 10/(3*n^4) + 496/(15*n^5) + 1384/(45*n^6) - 79724/(315*n^7) - 259306/(315*n^8) + 3718094/(2835*n^9) + 33233992/(2025*n^10) + ...).
a(n) = (n-3)*a(n-1) + 3*(n-1)*a(n-2) + (2*n-5)*a(n-3) - (n-3)*a(n-4) - (2*n-13)*a(n-5) - (n-8)*a(n-6) + (n-6)*a(n-7).
(End)

More terms from Ivana Jovovic (ivana121(AT)EUnet.yu), Nov 11 2007

a(0)=1 prepended by Max Alekseyev, Jun 14 2011

A235943 Number a(n,k) of positions (cyclic permutations) of circular permutations of [n] with exactly k (unspecified) increasing or decreasing modular runs (3-sequences), with clockwise and counterclockwise traversals counted as distinct; triangle a(n,k) read by rows, 0<=k<=n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 16, 0, 0, 0, 8, 60, 50, 0, 0, 0, 10, 456, 144, 108, 0, 0, 0, 12, 3458, 1078, 294, 196, 0, 0, 0, 14, 29296, 7936, 2240, 512, 320, 0, 0, 0, 16, 275166, 66096, 16200, 4104, 810, 486, 0, 0, 0, 18, 2843980, 611200, 135600, 29200, 6900, 1200, 700, 0, 0, 0, 20

Offset: 0

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

Arrangements that differ in the direction in which the cycle is traversed count as different.

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Paul J. Campbell, Rows n = 0..13, flattened
Paul J. Campbell, Table of rows n = 0..13 of A235943
Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235939, A235940, A235941, A235942.

A235937 Number of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals not counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 11, 62, 408, 3056, 25821, 242802, 2517303, 28540102, 351383192, 4669815008, 66640974977, 1016522211474, 16507095990251, 284343231536742, 5178919228252440

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

nonn

Arrangements that differ only in the direction in which the cycle is traversed do not count as different.

This sequence is the same as for straight permutations of {0,1,...,n} that begin with {0,1} and end with {n-1,n} but have no increasing or decreasing 3-sequence, viz., the sequence b(0,1...n-2,n-1) in Dymáček and Lambert.

			With specified sequence 123:
a(5) = 1: 12354.
a(6) = 2: 123564, 123645.
a(7) = 11: 1235476, 1235746, 1235764, 1236475, 1236574, 1236745, 1236754, 1237465, 1237546, 1237564, 1237645.

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235938, A235939, A235940, A235941, A235942, A235943.

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

A235938 Number of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 2, 4, 22, 124, 816, 6112, 51642, 485604, 5034606, 57080204, 702766384, 9339630016, 133281949954, 2033044422948, 33014191980502, 568686463073484, 10357838456504880

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

nonn

			With specified sequence 123:
a(5) = 2: 12354, 32154.
a(6) = 4: 123564, 321564, 123645, 321546.

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235939, A235940, A235941, A235942, A235943.

a(n) = 2*A235937(n).

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

A235939 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 5, 12, 77, 496, 3672, 30560, 284031, 2913624, 32724939, 399561428, 5270747880, 74717040128, 1132896574609, 18297399806532, 313634823814769, 5686864630734840, 108757303793301240

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

nonn

Arrangements that differ only in the direction in which the cycle is traversed do not count as different.

			a(5) = 5: 12354, 23415, 34521, 45132, 51243.

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235940, A235941, A235942, A235943.

a(n) = n*A235937(n).

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

A235940 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 10, 24, 154, 992, 7344, 61120, 568062, 5827248, 65449878, 799122856, 10541495760, 149434080256, 2265793149218, 36594799613064, 627269647629538, 11373729261469680, 217514607586602480

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences.

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011), Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235939, A235941, A235942, A235943.

a(n) = 2n*A235937(n).
a(n) = n*A235938(n).
a(n) = 2*A235939(n).

a(20)-a(21) added using the data at A235939 by Amiram Eldar, May 06 2024

A235941 Positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 25, 72, 539, 3968, 33048, 305600, 3124341, 34963488, 425424207, 5593859992, 79061218200, 1195472642048, 19259241768353, 329353196517576, 5959061652480611, 113737292614696800, 2283903379659326040

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

nonn

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235939, A235940, A235942, A235943.

a(n) = n^2 * A235937(n).

a(n) = n * A235939(n).

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

A235942 Number of positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct.

Original entry on oeis.org

0, 0, 0, 0, 50, 144, 1078, 7936, 66096, 611200, 6248682, 69926976, 850848414, 11187719984, 158122436400, 2390945284096, 38518483536706, 658706393035152, 11918123304961222, 227474585229393600, 4567806759318652080

Offset: 1

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

nonn

Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences

Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011) Article 11.1.6.

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235939, A235940, A235941, A235943.

a(n) = 2*n^2 * A235937(n).
a(n) = n^2 * A235938(n).
a(n) = 2*n * A235939(n).
a(n) = n * A235940(n).
a(n) = 2 * A235941(n).

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

A165963 Number of permutations of length n without increasing or decreasing modular 3-sequences.

Original entry on oeis.org

0, 16, 80, 516, 3794, 31456, 290970, 2974380, 33311520, 405773448, 5342413414, 75612301688

Offset: 3

Isaac Lambert, Oct 07 2009

nonn

Increasing modular 3-sequences are of the following form: i,i+1,i+2, where arithmetic is modulo n, while correspondingly decreasing modular 3-sequences are of the form i,i-1,i-2, where arithmetic is modulo n.

			For n=4 there are a(4)=16 solutions, thus there are 4!-a(4)=8 permutations of length 4 with increasing or decreasing modular 3-sequences. These are the permutations (0,1,2,3), (0,3,2,1), (1,2,3,0), (1,0,3,2), (2,3,0,1), (2,1,0,3), (3,0,1,2), and (3,2,1,0).

W. M. Dymacek, I. Lambert, Permutations Avoiding Runs of i, i+1, i+2 or i, i-1, i-2 , J. Int. Seq. 14 (2011) # 11.1.6, Table 1.

Cf. A095816, A165964, A078628.

Let b(n) be the sequence A165964. Then this sequence a(n)=n(b(n)).

cp's OEIS Frontend

A078628 Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A095816 Number of permutations of 1..n with no three elements in correct or reverse order.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

Extensions

A235943 Number a(n,k) of positions (cyclic permutations) of circular permutations of [n] with exactly k (unspecified) increasing or decreasing modular runs (3-sequences), with clockwise and counterclockwise traversals counted as distinct; triangle a(n,k) read by rows, 0<=k<=n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A235937 Number of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals not counted as distinct.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A235938 Number of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals counted as distinct.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Formula

Extensions

A235939 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions

A235940 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct.

Views

Author

Keywords

References

Links

Crossrefs

Formula

Extensions

A235941 Positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.

Views

Author

Keywords

References

Links

Crossrefs

Formula

Extensions

A235942 Number of positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct.