OFFSET
1,1
COMMENTS
(-48, a(1)) and (A157119(n), a(n+1)) are solutions (x, y) to the Diophantine equation x^2+(x+103)^2 = y^2.
LINKS
Index entries for linear recurrences with constant coefficients, signature (0,0,6,0,0,-1).
FORMULA
a(n) = 6*a(n-3)-a(n-6) for n > 6; a(1) = 73, a(2) = 103, a(3) = 205, a(4) = 233, a(5) = 515, a(6) = 1157.
G.f.: x*(1-x)*(73+176*x+381*x^2+176*x^3+73*x^4) / (1-6*x^3+x^6).
a(3*k-1) = 103*A001653(k) for k >= 1.
Limit_{n -> oo} a(n)/a(n-3) = 3+2*sqrt(2).
Limit_{n -> oo} a(n)/a(n-1) = (3+2*sqrt(2))*(11-3*sqrt(2))^2/(11+3*sqrt(2))^2 for n mod 3 = 1.
Limit_{n -> oo} a(n)/a(n-1) = (11+3*sqrt(2))/(11-3*sqrt(2)) for n mod 3 = {0, 2}.
EXAMPLE
MATHEMATICA
Select[Table[Sqrt[x^2+(x+103)^2], {x, -50, 3*10^6}], IntegerQ] (* THe program generates the first 20 terms of the sequence. *) (* or *) LinearRecurrence[ {0, 0, 6, 0, 0, -1}, {73, 103, 205, 233, 515, 1157}, 50](* Harvey P. Dale, Aug 19 2020 *)
PROG
(PARI) {forstep(n=-48, 1100000000, [1, 3], if(issquare(2*n^2+206*n+10609, &k), print1(k, ", ")))}
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Klaus Brockhaus, Feb 25 2009
EXTENSIONS
Typo corrected by Klaus Brockhaus, Mar 01 2009
STATUS
approved