|
%I #27 Sep 08 2022 08:44:38
%S 14,38416,105413504,289254654976,793714773254144,2177953337809371136,
%T 5976303958948914397184,16398978063355821105872896,
%U 44998795805848373114515226624,123476695691247935826229781856256,338820052976784335907174521413566464,929722225368296217729286886758826377216
%N a(n) = 14^(3*n + 1).
%H Vincenzo Librandi, <a href="/A013754/b013754.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).
%F From _Philippe Deléham_, Nov 30 2008: (Start)
%F a(n) = 2744*a(n-1); a(0)=14.
%F G.f.: 14/(1-2744*x).
%F a(n) = A013755(n)/14. (End)
%t 14^(3*Range[0,20]+1) (* or *) NestList[2744#&,14,20] (* _Harvey P. Dale_, May 16 2020 *)
%o (Magma) [14^(3*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 27 2011
%o (PARI) a(n)=14^(3*n+1) \\ _Charles R Greathouse IV_, Jun 27 2011
%Y Subsequence of A001023.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 