|
%I #24 Sep 08 2022 08:44:38
%S 19,6859,2476099,893871739,322687697779,116490258898219,
%T 42052983462257059,15181127029874798299,5480386857784802185939,
%U 1978419655660313589123979,714209495693373205673756419
%N a(n) = 19^(2*n + 1).
%H Vincenzo Librandi, <a href="/A013724/b013724.txt">Table of n, a(n) for n = 0..200</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (361).
%F From _Philippe Deléham_, Nov 28 2008: (Start)
%F a(n) = 361*a(n-1); a(0)=19.
%F G.f.: 19/(1-361*x). (End)
%p seq(19^(2*n+1),n=0..10); # _Nathaniel Johnston_, Jun 25 2011
%t NestList[361#&,19,20] (* _Harvey P. Dale_, Jun 12 2017 *)
%o (Magma) [19^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011
%o (PARI) a(n)=19^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016
%Y Bisection of A001029.
%Y Cf. A013708-A013723, A013725-A013729.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 