This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284718 Number of indecomposable permutations avoiding the pattern 1324. 1

%I

%S 1,1,1,3,13,69,396,2355,14363,89706,573828,3758866,25195016,172591294,

%T 1206482317,8592827996,62257890162,458214977642,3421294482237,

%U 25884913987768,198236423171483,1535315006313002,12015208271571543,94943908405295171,757044806198966152

%N Number of indecomposable permutations avoiding the pattern 1324.

%H Bjarki Ágúst Guðmundsson, <a href="/A284718/b284718.txt">Table of n, a(n) for n = 0..50</a> (terms 25..50 by Bjarki Ágúst Guðmundsson, computed using Kotesovec's formula and terms from the Conway/Guttmann/Zinn-Justin reference)

%H Andrew R. Conway, Anthony J. Guttmann and Paul Zinn-Justin, <a href="https://arxiv.org/abs/1709.01248">1324-avoiding permutations revisited</a>, arXiv preprint arXiv:1709.01248 [math.CO], 2017.

%H A. L. L. Gao, S. Kitaev, P. B. Zhang. <a href="https://arxiv.org/abs/1605.05490">On pattern avoiding indecomposable permutations</a>, arXiv:1605.05490 [math.CO], 2016.

%F For n>1, a(n) = A061552(n) + 3*A000108(n) - A000108(n+1) - 2*A000108(n-1). - _Vaclav Kotesovec_, Apr 02 2017

%Y Cf. A061552.

%K nonn

%O 0,4

%A _N. J. A. Sloane_, Apr 02 2017

%E More terms from _Vaclav Kotesovec_, Apr 02 2017

%E a(0) prepended by _Bjarki Ágúst Guðmundsson_, Dec 18 2017

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

Last modified June 26 20:30 EDT 2019. Contains 324380 sequences. (Running on oeis4.)