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.

A350921 a(0) = 3, a(1) = 3, and a(n) = 6*a(n-1) - a(n-2) - 4 for n >= 2.

Original entry on oeis.org

3, 3, 11, 59, 339, 1971, 11483, 66923, 390051, 2273379, 13250219, 77227931, 450117363, 2623476243, 15290740091, 89120964299, 519435045699, 3027489309891, 17645500813643, 102845515571963, 599427592618131, 3493720040136819, 20362892648202779, 118683635849079851, 691738922446276323
Offset: 0

Views

Author

Max Alekseyev, Jan 22 2022

Keywords

Comments

One of 10 linear second-order recurrence sequences satisfying (a(n)*a(n-1)-1) * (a(n)*a(n+1)-1) = (a(n)+1)^4 and together forming A350916.

Crossrefs

Other sequences satisfying (a(n)*a(n-1)-1) * (a(n)*a(n+1)-1) = (a(n)+1)^4: A103974, A350917, A350919, A350920, A350922, A350923, A350924, A350925, A350926.

Formula

G.f.: (3 - 18*x + 11*x^2)/((1 - x)*(1 - 6*x + x^2)). - Stefano Spezia, Jan 22 2022
a(n) = 2*A001653(n) + 1 = 4*A011900(n-1) - 1 for n >= 1. - Hugo Pfoertner, Jan 22 2022