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.

A370653 Number of permutations of [n] having exactly three adjacent 4-cycles.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 4, 20, 120, 836, 6700, 60360, 603960, 6646090, 79773180, 1037232420, 14523065760, 217865924620, 3486094113460, 59266711626080, 1066844378466720, 20270696788641635, 405424394055173080, 8514090075293512920
Offset: 0

Views

Author

Seiichi Manyama, Feb 24 2024

Keywords

Crossrefs

Column k=3 of A177252.

Programs

  • PARI
    my(N=30, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], Vec(sum(k=3, N, k!*x^(k+9)/(1+x^4)^(k+1))/6))
    
  • PARI
    a(n, k=3, q=4) = sum(j=0, n\q-k, (-1)^j*(n-(q-1)*(j+k))!/j!)/k!;

Formula

G.f.: (1/6) * Sum_{k>=3} k! * x^(k+9) / (1+x^4)^(k+1).
a(n) = (1/6) * Sum_{k=0..floor(n/4)-3} (-1)^k * (n-3*k-9)! / k!.