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.

A350983 a(0)=1, a(1)=25, a(2)=865; a(n) = 35*(a(n-1)-a(n-2))+a(n-3).

Original entry on oeis.org

1, 25, 865, 29401, 998785, 33929305, 1152597601, 39154389145, 1330096633345, 45184131144601, 1534930362283105, 52142448186480985, 1771308307978070401, 60172340023067912665, 2044088252476330960225, 69438828244172184735001, 2358876072049377950029825, 80132347621434678116279065
Offset: 0

Views

Author

N. J. A. Sloane, Mar 08 2022

Keywords

References

  • P.-F. Teilhet, Query 2376, L'Intermédiaire des Mathématiciens, 11 (1904), 138-139.

Crossrefs

Programs

  • Mathematica
    nxt[{a_,b_,c_}]:={b,c,35(c-b)+a}; NestList[nxt,{1,25,865},20][[;;,1]] (* or *) LinearRecurrence[ {35,-35,1},{1,25,865},20] (* Harvey P. Dale, Sep 04 2024 *)

Formula

G.f.: -(5*x - 1)^2/((x - 1)*(x^2 - 34*x + 1)). - Chai Wah Wu, Mar 08 2022