0,2

I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7(1969), pps. 181-193.

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 122-125, 194-196.

E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart., 7(1969), pps. 231-242.

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

a(n) = 7*a(n-1) - 7*a(n-2) + a(n-3); a(n) = ((4+sqrt(2))/8)*(3+2*sqrt(2))^(n-1)+((4-sqrt(2))/8)*(3-2*sqrt(2))^(n-1). - Antonio A. Olivares (olivares14031(AT)yahoo.com), Mar 29 2008

a(n) = a001653(n) - a001653(n - 1) - ... - a001653(n - (n - 1)) - Antonio A. Olivares (olivares14031(AT)yahoo.com), Mar 29 2008

Sequence satisfies -7 = f(a(n), a(n+1)) where f(u, v) = u^2 + v^2 - 6*u*v. - Michael Somos Sep 28 2008

G.f.: (1 - 2*x) / (1 - 6*x + x^2). a(n) = (7 + a(n-1)^2) / a(n-2). - Michael Somos Sep 28 2008

a[0]:=1: a[1]:=4: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006

(PARI) {a(n) = real((3 + 2*quadgen(8))^n * (1 + quadgen(8) / 4))} /* Michael Somos Sep 28 2008 */

(PARI) {a(n) = polchebyshev(n, 1, 3) + polchebyshev(n-1, 2, 3)} /* Michael Somos Sep 28 2008 */

Cf. A001653, A001541, A038725.

Cf. A001653.

A038725(n) = a(-n).

Adjacent sequences: A038720 A038721 A038722 this_sequence A038724 A038725 A038726

Sequence in context: A015532 A144465 A024050 this_sequence A091640 A067110 A158197

easy,nonn

Barry E. Williams, May 02 2000

More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 03 2000