|
%I #15 Sep 08 2022 08:44:38
%S 169,62748517,23298085122481,8650415919381337933,
%T 3211838877954855105157369,1192533292512492016559195008117,
%U 442779263776840698304313192148785281,164400841185494513395503358052498933338333,61040881526285814362156628321386486455989674569
%N a(n) = 13^(5*n + 2).
%H Vincenzo Librandi, <a href="/A013867/b013867.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 (371293).
%F a(0)=169, a(n)=371293*a(n-1). - _Harvey P. Dale_, Apr 21 2013
%t 13^(5Range[0,10]+2) (* or *) NestList[371293#&,169,10] (* _Harvey P. Dale_, Apr 21 2013 *)
%o (Magma) [13^(5*n+2): n in [0..10]]; // _Vincenzo Librandi_, Jul 09 2011
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 