%I #40 Jun 08 2022 03:56:12
%S 0,2,36,646,11592,208010,3732588,66978574,1201881744,21566892818,
%T 387002188980,6944472508822,124613502969816,2236098580947866,
%U 40125160954091772,720016798592704030
%N Numbers x such that 20*x^2 + 1 is a perfect square.
%C Denote as {a,b,c,d} the second-order linear recurrence a(n) = c*a(n-1) + d*a(n-2) with initial terms a, b. The following sequences and recurrence formulas are related to integer solutions of k*x^2 + 1 = y^2.
%C .
%C k x y
%C - ----------------------- -----------------------
%C 2 A001542 {0,2,6,-1} A001541 {1,3,6,-1}
%C 3 A001353 {0,1,4,-1] A001075 {1,2,4,-1}
%C 5 A060645 {0,4,18,-1} A023039 {1,9,18,-1}
%C 6 A001078 {0,2,10,-1} A001079 {1,5,10,-1}
%C 7 A001080 {0,3,16,-1} A001081 {1,8,16,-1}
%C 8 A001109 {0,1,6,-1} A001541 {1,3,6,-1}
%C 10 A084070 {0,1,38,-1} A078986 {1,19,38,-1}
%C 11 A001084 {0,3,20,-1} A001085 {1,10,20,-1}
%C 12 A011944 {0,2,14,-1} A011943 {1,7,14,-1}
%C 13 A075871 {0,180,1298,-1} A114047 {1,649,1298,-1}
%C 14 A068204 {0,4,30,-1} A069203 {1,15,30,-1}
%C 15 A001090 {0,1,8,-1} A001091 {1,4,8,-1}
%C 17 A121740 {0,8,66,-1} A099370 {1,33,66,-1}
%C 18 A202299 {0,4,34,-1} A056771 {1,17,34,-1}
%C 19 A174765 {0,39,340,-1} A114048 {1,179,340,-1}
%C 20 a(n) {0,2,18,-1} A023039 {1,9,18,-1}
%C 21 A174745 {0,12,110,-1} A114049 {1,55,110,-1}
%C 22 A174766 {0,42,394,-1} A114050 {1,197,394,-1}
%C 23 A174767 {0,5,48,-1} A114051 {1,24,48,-1}
%C 24 A004189 {0,1,10,-1} A001079 {1,5,10,-1}
%C 26 A174768 {0,10,102,-1} A099397 {1,51,102,-1}
%C The sequence of the c parameter is listed in A180495.
%H Bruno Berselli, <a href="/A207832/b207832.txt">Table of n, a(n) for n = 0..500</a>
%H Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL23/Nemeth/nemeth7.html">Ellipse Chains and Associated Sequences</a>, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (18,-1).
%F a(n) = 18*a(n-1) - a(n-2).
%F From _Bruno Berselli_, Feb 21 2012: (Start)
%F G.f.: 2*x/(1-18*x+x^2).
%F a(n) = -a(-n) = 2*A049660(n) = ((2 + sqrt(5))^(2*n)-(2 - sqrt(5))^(2*n))/(4*sqrt(5)). (End)
%F a(n) = Fibonacci(6*n)/4. - _Bruno Berselli_, Jun 19 2019
%F For n>=1, a(n) = A079962(6n-3). - _Christopher Hohl_, Aug 22 2021
%p readlib(issqr):for x from 1 to 720016798592704030 do if issqr(20*x^2+1) then print(x) fi od;
%t LinearRecurrence[{18, -1}, {0, 2}, 16] (* _Bruno Berselli_, Feb 21 2012 *)
%t Table[2 ChebyshevU[-1 + n, 9], {n, 0, 16}] (* _Herbert Kociemba_, Jun 05 2022 *)
%o (Magma) m:=16; R<x>:=PowerSeriesRing(Integers(), m); [0] cat Coefficients(R!(2*x/(1-18*x+x^2))); // _Bruno Berselli_, Jun 19 2019
%o (Maxima) makelist(expand(((2+sqrt(5))^(2*n)-(2-sqrt(5))^(2*n))/(4*sqrt(5))), n, 0, 15); /* _Bruno Berselli_, Jun 19 2019 */
%Y Cf. A023039, A049660, A079962.
%K nonn,easy
%O 0,2
%A _Gary Detlefs_, Feb 20 2012