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.

A384256 a(n) = Product_{k=0..n-1} (n+3*k+1).

Original entry on oeis.org

1, 2, 18, 280, 6160, 174960, 6086080, 250490240, 11904278400, 641472832000, 38645634227200, 2573895458534400, 187787322731008000, 14894027431162880000, 1275931456704672768000, 117412145664335441920000, 11550258696757088788480000, 1209613643310990696210432000
Offset: 0

Views

Author

Seiichi Manyama, May 23 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = prod(k=0, n-1, n+3*k+1);
    
  • Sage
    def a(n): return 3^n*rising_factorial((n+1)/3, n)

Formula

a(n) = 3^n * RisingFactorial((n+1)/3,n).
a(n) = n! * [x^n] 1/(1 - 3*x)^((n+1)/3).