login
Expansion of e.g.f.: 2/(2-2*x-x^2).
20

%I #102 Jul 20 2024 10:54:12

%S 1,1,3,12,66,450,3690,35280,385560,4740120,64751400,972972000,

%T 15949256400,283232149200,5416632421200,110988861984000,

%U 2425817682288000,56333385828720000,1385151050307024000,35950878932544576000,982196278209226080000,28175806418228108640000

%N Expansion of e.g.f.: 2/(2-2*x-x^2).

%C Number of ordered partitions of {1,..,n} with at most 2 elements per block. - Bob Proctor, Apr 18 2005

%C In other words, number of preferential arrangements of n things (see A000670) in which each clump has size 1 or 2. - _N. J. A. Sloane_, Apr 13 2014

%C Recurrences (of the hypergeometric type of the Jovovic formula) mean: multiplying the sequence vector from the left with the associated matrix of the recurrence coefficients (here: an infinite lower triangular matrix with the natural numbers in the main diagonal and the triangular series in the subdiagonal) recovers the sequence up to an index shift. In that sense, this sequence here and many other sequences of the OEIS are eigensequences. - _Gary W. Adamson_, Feb 14 2011

%C Number of intervals in the weak (Bruhat) order of S_n that are Boolean algebras. - _Richard Stanley_, May 09 2011

%C a(n) = D^n(1/(1-x)) evaluated at x = 0, where D is the operator sqrt(1+2*x)*d/dx. Cf. A000085, A005442 and A052585. - _Peter Bala_, Dec 07 2011

%C From _Gus Wiseman_, Jul 04 2020: (Start)

%C Also the number of (1,1,1)-avoiding or cubefree sequences of length n covering an initial interval of positive integers. For example, the a(0) = 1 through a(3) = 12 sequences are:

%C () (1) (11) (112)

%C (12) (121)

%C (21) (122)

%C (123)

%C (132)

%C (211)

%C (212)

%C (213)

%C (221)

%C (231)

%C (312)

%C (321)

%C (End)

%H Alois P. Heinz, <a href="/A080599/b080599.txt">Table of n, a(n) for n = 0..200</a>

%H S. Alex Bradt, Jennifer Elder, Pamela E. Harris, Gordon Rojas Kirby, Eva Reutercrona, Yuxuan (Susan) Wang, and Juliet Whidden, <a href="https://arxiv.org/abs/2401.06937">Unit interval parking functions and the r-Fubini numbers</a>, arXiv:2401.06937 [math.CO], 2024. See page 10.

%H Jennifer Elder, Pamela E. Harris, Jan Kretschmann, and J. Carlos Martínez Mori, <a href="https://arxiv.org/abs/2306.14734">Boolean intervals in the weak order of S_n</a>, arXiv:2306.14734 [math.CO], 2023.

%H Laura Gellert and Raman Sanyal, <a href="https://arxiv.org/abs/1512.08448">On degree sequences of undirected, directed, and bidirected graphs</a>, arXiv preprint arXiv:1512.08448 [math.CO], 2015.

%H Hannah Golab, <a href="http://danaernst.com/scholarship/GolabThesis.pdf">Pattern avoidance in Cayley permutations</a>, Master's Thesis, Northern Arizona Univ. (2024). See p. 36.

%H Harri Hakula, Helmut Harbrecht, Vesa Kaarnioja, Frances Y. Kuo, and Ian H. Sloan, <a href="https://arxiv.org/abs/2210.17329">Uncertainty quantification for random domains using periodic random variables</a>, arXiv:2210.17329 [math.NA], 2022.

%H Dixy Msapato, <a href="https://arxiv.org/abs/2002.12194">Counting the number of tau-exceptional sequences over Nakayama algebras</a>, arXiv:2002.12194 [math.RT], 2020.

%H Robert A. Proctor, <a href="https://arxiv.org/abs/math/0606404">Let's Expand Rota's Twelvefold Way For Counting Partitions!</a>, arXiv:math/0606404 [math.CO], 2006-2007.

%H Gus Wiseman, <a href="https://oeis.org/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>

%H <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>

%F a(n) = n*a(n-1) + (n*(n-1)/2)*a(n-2). - _Vladeta Jovovic_, Aug 22 2003

%F E.g.f.: 1/(1-x-x^2/2). - _Richard Stanley_, May 09 2011

%F a(n) ~ n!*((1+sqrt(3))/2)^(n+1)/sqrt(3). - _Vaclav Kotesovec_, Oct 13 2012

%F a(n) = n!*((1+sqrt(3))^(n+1) - (1-sqrt(3))^(n+1))/(2^(n+1)*sqrt(3)). - _Vladimir Reshetnikov_, Oct 31 2015

%F a(n) = A090932(n) * A002530(n+1). - _Robert Israel_, Nov 01 2015

%e From _Gus Wiseman_, Jul 04 2020: (Start)

%e The a(0) = 1 through a(3) = 12 ordered set partitions with block sizes <= 2 are:

%e {} {{1}} {{1,2}} {{1},{2,3}}

%e {{1},{2}} {{1,2},{3}}

%e {{2},{1}} {{1,3},{2}}

%e {{2},{1,3}}

%e {{2,3},{1}}

%e {{3},{1,2}}

%e {{1},{2},{3}}

%e {{1},{3},{2}}

%e {{2},{1},{3}}

%e {{2},{3},{1}}

%e {{3},{1},{2}}

%e {{3},{2},{1}}

%e (End)

%p a:= n-> n! *(Matrix([[1,1], [1/2,0]])^n)[1,1]:

%p seq(a(n), n=0..40); # _Alois P. Heinz_, Jun 01 2009

%p a:= gfun:-rectoproc({a(n) = n*a(n-1)+(n*(n-1)/2)*a(n-2),a(0)=1,a(1)=1},a(n),remember):

%p seq(a(n), n=0..40); # _Robert Israel_, Nov 01 2015

%t Table[n!*SeriesCoefficient[-2/(-2+2*x+x^2),{x,0,n}],{n,0,20}] (* _Vaclav Kotesovec_, Oct 13 2012 *)

%t Round@Table[n! ((1+Sqrt[3])^(n+1) - (1-Sqrt[3])^(n+1))/(2^(n+1) Sqrt[3]), {n, 0, 20}] (* _Vladimir Reshetnikov_, Oct 31 2015 *)

%o (PARI) Vec(serlaplace((2/(2-2*x-x^2) + O(x^30)))) \\ _Michel Marcus_, Nov 02 2015

%o (Magma) [n le 2 select 1 else (n-1)*Self(n-1) + Binomial(n-1,2)*Self(n-2): n in [1..31]]; // _G. C. Greubel_, Jan 31 2023

%o (SageMath)

%o A002605=BinaryRecurrenceSequence(2,2,0,1)

%o def A080599(n): return factorial(n)*A002605(n+1)/2^n

%o [A080599(n) for n in range(41)] # _G. C. Greubel_, Jan 31 2023

%Y Cf. A000085, A000670, A002530, A002605, A005442, A052585, A052611.

%Y Cf. A090932, A102726, A106356, A232464, A333755, A335455, A335456.

%Y Column k=2 of A276921.

%Y Cubefree numbers are A004709.

%Y (1,1)-avoiding patterns are A000142.

%Y (1,1,1)-avoiding compositions are A232432.

%Y (1,1,1)-matching patterns are A335508.

%Y (1,1,1)-avoiding permutations of prime indices are A335511.

%Y (1,1,1)-avoiding compositions are ranked by A335513.

%Y (1,1,1,1)-avoiding patterns are A189886.

%K nonn,eigen

%O 0,3

%A Detlef Pauly (dettodet(AT)yahoo.de), Feb 24 2003