login
a(n) = 19^(4*n + 1).
1

%I #22 Apr 12 2023 14:53:51

%S 19,2476099,322687697779,42052983462257059,5480386857784802185939,

%T 714209495693373205673756419,93076495688256089536609610280499,

%U 12129821994589221844500501021364910179,1580770532156861979997149793605296459437459

%N a(n) = 19^(4*n + 1).

%H Vincenzo Librandi, <a href="/A013810/b013810.txt">Table of n, a(n) for n = 0..100</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 (130321).

%F a(n) = 19^A016813(n) = A001029(A016813(n)). - _Wesley Ivan Hurt_, Jan 28 2014

%p A013810:=n->19^(4*n + 1); seq(A013810(n), n=0..15); # _Wesley Ivan Hurt_, Jan 28 2014

%t Table[19^(4n + 1), {n, 0, 15}] (* _Wesley Ivan Hurt_, Jan 28 2014 *)

%t NestList[130321#&,19,20] (* _Harvey P. Dale_, Apr 12 2023 *)

%o (Magma) [19^(4*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jul 06 2011

%Y Cf. A001029, A016813.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_