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.

Showing 1-1 of 1 results.

A051398 a(n) = -(n-3)*a(n-1) + 2*(n-2)^2.

Original entry on oeis.org

2, 6, 6, 14, -6, 102, -514, 3726, -29646, 267014, -2669898, 29369166, -352429654, 4581585894, -64142202066, 962133031502, -15394128503454, 261700184559366, -4710603322067866, 89501463119290254, -1790029262385804198, 37590614510101889126
Offset: 3

Views

Author

Keywords

Crossrefs

Cf. A056158.

Programs

  • Mathematica
    a[3]=2; a[n_]:=a[n]=-(n-3)*a[n-1]+2*(n-2)^2; Array[a,22,3] (* Stefano Spezia, Sep 16 2022 *)
    nxt[{n_,a_}]:={n+1,2(n-1)^2-a(n-2)}; NestList[nxt,{3,2},30][[;;,2]] (* Harvey P. Dale, Nov 18 2024 *)

Formula

a(n) = A056158(n) + 2n.
Showing 1-1 of 1 results.