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.
%I A167709 #26 Oct 06 2019 18:24:02
%S A167709 0,1,15,24,220,351,560,5124,8175,74801,119340,190399,1742145,2779476,
%T A167709 25432120,40575249,64735100,592324176,945013665,8646845999,
%U A167709 13795465320,22009743601,201388477695,321301866624,2939902207540,4690417633551
%N A167709 Numbers y such that 19*y^2 + 81 is a square.
%D A167709 A. H. Beiler, "Recreations in the theory of numbers": Ex. 38, page 298 (Dover Publications, Inc., New York, 1966).
%H A167709 G. C. Greubel, <a href="/A167709/b167709.txt">Table of n, a(n) for n = 0..1000</a>
%H A167709 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,340,0,0,0,0,-1).
%F A167709 G.f.: (z + 15*z^2 + 24*z^3 + 220*z^4 + 351*z^5 + 560*z^6 + 5124*z^7 + 8175*z^8 + 74801*z^9 - 340*z^5*(z + 15*z^2 + 24*z^3 + 220*z^4) ) / (1 - 340*z^5 + z^10).
%F A167709 a(n+10) = 340*a(n+5) - a(n).
%F A167709 a(n+5) = 170*a(n) + 39*sqrt(19*a(n)^2 + 81).
%F A167709 For n == 0 (mod 5): a(n) = ( 9*sqrt(19) )/38*(170 + 39*sqrt(19))^(n) + (-9*sqrt(19))/38*(170 - 39*sqrt(19))^(n); the subsequence is 0, 351, 119340, 40575249, 13795465320, 4690417633551, 1594728199942020, 542202897562653249, 184347390443102162640, ...
%F A167709 For n == 1 (mod 5): a(n) = (10*sqrt(19) + 19)/38*(170 + 39*sqrt(19))^(n) + (-10*sqrt(19) + 19)/38*(170 - 39*sqrt(19))^(n); the subsequence is 1, 560, 190399, 64735100, 22009743601, 7483248089240, 2544282340597999, 865048512555230420, 294113949986437744801, ...
%F A167709 For n == 2 (mod 5): a(n) = (66*sqrt(19) + 285)/38*(170 + 39*sqrt(19))^(n) + (-66*sqrt(19) + 285)/38*(170 - 39*sqrt(19))^(n); the subsequence is 15, 5124, 1742145, 592324176, 201388477695, 68471490092124, 23280105242844465, 7915167311077025976, 2691133605660945987375, ...
%F A167709 For n == 3 (mod 5): a(n) = (105*sqrt(19) + 456)/38*(170 + 39*sqrt(19))^(n) + (-105*sqrt(19) + 456)/38*(170 - 39*sqrt(19))^(n); the subsequence is 24, 8175, 2779476, 945013665, 321301866624, 109241689638495, 37141853175221676, 12628120837885731345, 4293523943027973435624, ...
%F A167709 For n == 4 (mod 5): a(n) = (959*sqrt(19) + 4180)/38*(170 + 39*sqrt(19))^(n) + (-959*sqrt(19) + 4180)/38*(170 - 39*sqrt(19))^(n); the subsequence is 220, 74801, 25432120, 8646845999, 2939902207540, 999558103717601, 339846815361776800, 115546917664900394399, 39285612159250772318860, ...
%e A167709 a(0) = 0 because 19*0 + 81 = 9^2, a(1)=1 because 19*1 + 81 = 10^2.
%p A167709 a(0):=0:a(1):=1:a(2):=15:a(3):=24:a(4):=220:a(5):=351:a(6):=560: a(7):=5124: a(8):=8175:a(9):=74801:for n from 0 to 40 do a(n+10):=340*a(n+5)-a(n):od:seq(a(n),n=0..40);
%t A167709 a[0]=0; a[1]=a[-1]=1; a[2]=a[-2]=15; a[n_] := a[n] = 170*a[n-5]+39*Sqrt[19*a[n-5]^2+81]; Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Dec 19 2013 *)
%t A167709 LinearRecurrence[{0, 0, 0, 0, 340, 0, 0, 0, 0, -1}, {0, 1, 15, 24,
%t A167709 220, 351, 560, 5124, 8175, 74801}, 100] (* _G. C. Greubel_, Jun 20 2016 *)
%Y A167709 Cf. A167708, A167774, A167775, A167778, A167779, A167780.
%K A167709 easy,nonn
%O A167709 0,3
%A A167709 _Richard Choulet_, Nov 10 2009