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 A167779 #18 Sep 08 2022 08:45:48 %S A167779 105,35634,12115455,4119219066,1400522366985,476173485555834, %T A167779 161897584566616575,55044702579164079666,18715036979331220469865, %U A167779 6363057528270035795674434,2163420844574832839308837695,735556724097914895329209141866,250087122772446489579091799396745 %N A167779 Subsequence of A167708 whose indices are congruent to 4 mod 5, i.e., a(n) = A167708(5n+4). %H A167779 G. C. Greubel, <a href="/A167779/b167779.txt">Table of n, a(n) for n = 0..250</a> %H A167779 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (340,-1). %F A167779 a(n+2) = 340*a(n+1) - a(n). %F A167779 a(n+1) = 170*a(n) + 39*sqrt(19*a(n)^2 - 1539). %F A167779 G.f.: (105 - 66*z)/(1 - 340*z + z^2). %F A167779 a(n) = ((105 + 24*sqrt(19))/2)*(170 + 39*sqrt(19))^(n) + ((105 - 24*sqrt(19) )/2)*(170 - 39*sqrt(19))^(n). %e A167779 a(0) = A167708(4) = 105, a(1) = A167708(9) = 35634, ... %p A167779 u(0):=105:u(1):=35634:for n from 0 to 20 do u(n+2):=340*u(n+1)-u(n):od:seq(u(n),n=0..20); taylor(((105+35634*z-105*z*340)/(1-340*z+z^2)),z=0,20); for n from 0 to 20 do u(n):=simplify((24*sqrt(19)+105)/2*(170+39*sqrt(19))^(n)+(-24*sqrt(19)+105)/2*(170-39*sqrt(19))^(n)):od:seq(u(n),n=0..20); %t A167779 LinearRecurrence[{340, -1}, {105, 35634}, 50] (* _G. C. Greubel_, Jun 23 2016 *) %o A167779 (Magma) I:=[105,35634]; [n le 2 select I[n] else 340*Self(n-1)-Self(n-2): n in [1..20]]; // _Vincenzo Librandi_, Jun 25 2016 %Y A167779 Cf. A167708, A167709, A167774, A167775, A167778, A167780. %K A167779 easy,nonn %O A167779 0,1 %A A167779 _Richard Choulet_, Nov 11 2009