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.

A370652 Number of permutations of [n] having exactly two adjacent 4-cycles.

This page as a plain text file.
%I A370652 #15 Feb 24 2024 10:49:54
%S A370652 0,0,0,0,0,0,0,0,1,3,12,60,357,2508,20100,181080,1811886,19938270,
%T A370652 239319540,3111697260,43569197270,653597773860,10458282340380,
%U A370652 177800134878240,3200533135400175,60812090365924905,1216273182165519240,25542270225880538760
%N A370652 Number of permutations of [n] having exactly two adjacent 4-cycles.
%H A370652 R. A. Brualdi and Emeric Deutsch, <a href="http://arxiv.org/abs/1005.0781">Adjacent q-cycles in permutations</a>, arXiv:1005.0781 [math.CO], 2010.
%F A370652 G.f.: (1/2) * Sum_{k>=2} k! * x^(k+6) / (1+x^4)^(k+1).
%F A370652 a(n) = (1/2) * Sum_{k=0..floor(n/4)-2} (-1)^k * (n-3*k-6)! / k!.
%o A370652 (PARI) my(N=30, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0, 0], Vec(sum(k=2, N, k!*x^(k+6)/(1+x^4)^(k+1))/2))
%o A370652 (PARI) a(n, k=2, q=4) = sum(j=0, n\q-k, (-1)^j*(n-(q-1)*(j+k))!/j!)/k!;
%Y A370652 Column k=2 of A177252.
%Y A370652 Cf. A370426, A370528.
%K A370652 nonn
%O A370652 0,10
%A A370652 _Seiichi Manyama_, Feb 24 2024