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.

A350986 a(0)=3, a(1)=105, a(2)=3567; a(n) = 35*(a(n-1)-a(n-2))+a(n-3).

Original entry on oeis.org

3, 105, 3567, 121173, 4116315, 139833537, 4750223943, 161367780525, 5481754313907, 186218278892313, 6325939728024735, 214895732473948677, 7300128964386230283, 247989489056657880945, 8424342498961981721847, 286179655475650720661853, 9721683943673162520781155, 330251074429411874985897417
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
    LinearRecurrence[{34,-1},{3,105},20] (* Harvey P. Dale, Mar 24 2023 *)

Formula

From Chai Wah Wu, Mar 08 2022: (Start)
a(n) = 34*a(n-1) - a(n-2) for n > 1.
G.f.: 3*(x + 1)/(x^2 - 34*x + 1). (End)
Showing 1-1 of 1 results.