login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013864 a(n) = 12^(5*n + 3). 1

%I #15 Sep 08 2022 08:44:38

%S 1728,429981696,106993205379072,26623333280885243904,

%T 6624737266949237011120128,1648446623609512543951043690496,

%U 410186270246002225336426103593500672,102067469997853225734913580209377959215104,25397652694505813866070015990659936347412758528

%N a(n) = 12^(5*n + 3).

%H Vincenzo Librandi, <a href="/A013864/b013864.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 (248832).

%t NestList[248832#&,1728,10] (* _Harvey P. Dale_, Apr 01 2018 *)

%o (Magma) [12^(5*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jul 09 2011

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)