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.

A318184 a(n) = 2^(n * (n - 1)/2) * 3^((n - 1) * (n - 2)) * n^(n - 3).

Original entry on oeis.org

1, 1, 72, 186624, 13604889600, 24679069470425088, 1036715783690392172494848, 962459606796748852884396910313472, 19112837387997044228759204010262201783812096, 7926475921550134182551017087135940323782552453120000000, 67406870957147550175650545441605700298239194363455522532832462241792
Offset: 1

Views

Author

Rigoberto Florez, Aug 20 2018

Keywords

Comments

Discriminant of Fermat polynomials.
F(0)=0, F(1)=1 and F(n) = 3x F(n - 1) -2 F(n - 2) if n>1.

Crossrefs

Programs

  • Maple
    seq(2^(n*(n-1)/2)*3^((n-1)*(n-2))*n^(n-3),n=1..12); # Muniru A Asiru, Dec 07 2018
  • Mathematica
    F[0] = 0; F[1] = 1; F[n_] := F[n] = 3 x F[n - 1] - 2 F[n - 2];
    a[n_] := Discriminant[F[n], x];
    Array[a, 11] (* Jean-François Alcover, Dec 07 2018 *)
  • PARI
    a(n) = 2^(n*(n-1)/2) * 3^((n-1)*(n-2)) * n^(n-3); \\ Michel Marcus, Dec 07 2018