This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A013755 a(n) = 14^(3*n + 2). 2
 196, 537824, 1475789056, 4049565169664, 11112006825558016, 30491346729331195904, 83668255425284801560576, 229585692886981495482220544, 629983141281877223603213172736, 1728673739677471101567216945987584, 4743480741674980702700443299789930496 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (2744). EXAMPLE From Philippe Deléham, Dec 02 2008: (Start) a(n) = 2744*a(n-1); a(0)=196. G.f.: 196/(1-2744*x). a(n) = 14*A013754(n). (End) MATHEMATICA 14^(3*Range[0, 10]+2) (* or *) NestList[2744#&, 196, 10] (* Harvey P. Dale, Jan 12 2016 *) PROG (MAGMA) [14^(3*n+2): n in [0..15]]; // Vincenzo Librandi, Jun 27 2011 (PARI) a(n)=14^(3*n+2) \\ Charles R Greathouse IV, Jun 27 2011 CROSSREFS Subsequence of A001023. Sequence in context: A076002 A145020 A260863 * A071410 A013871 A306856 Adjacent sequences:  A013752 A013753 A013754 * A013756 A013757 A013758 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 12:47 EDT 2019. Contains 328257 sequences. (Running on oeis4.)