|
%I #27 Sep 08 2022 08:44:38
%S 196,537824,1475789056,4049565169664,11112006825558016,
%T 30491346729331195904,83668255425284801560576,
%U 229585692886981495482220544,629983141281877223603213172736,1728673739677471101567216945987584,4743480741674980702700443299789930496
%N a(n) = 14^(3*n + 2).
%H Vincenzo Librandi, <a href="/A013755/b013755.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 (2744).
%e From _Philippe Deléham_, Dec 02 2008: (Start)
%e a(n) = 2744*a(n-1); a(0)=196.
%e G.f.: 196/(1-2744*x).
%e a(n) = 14*A013754(n). (End)
%t 14^(3*Range[0,10]+2) (* or *) NestList[2744#&,196,10] (* _Harvey P. Dale_, Jan 12 2016 *)
%o (Magma) [14^(3*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jun 27 2011
%o (PARI) a(n)=14^(3*n+2) \\ _Charles R Greathouse IV_, Jun 27 2011
%Y Subsequence of A001023.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 