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!)
A232998 a(n) = 2^((n+1)^2)*3^(n*(n+1)). 0

%I #11 Nov 27 2018 04:45:43

%S 2,144,373248,34828517376,116997070082015232,

%T 14148730862126934905585664,61597414834991926584601402260062208,

%U 9654059848037384195421778226918440269760167936,54470327768942860701549299585257673594965942082487957061632

%N a(n) = 2^((n+1)^2)*3^(n*(n+1)).

%H Tri Lai, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p31">New aspects of regions whose tilings are enumerated by perfect powers</a>, Electronic Journal of Combinatorics, 20(4), 2013, #P31. See Th. 25.

%t Table[2^((n+1)^2)*3^(n(n+1)),{n,0,10}] (* _Harvey P. Dale_, Apr 26 2014 *)

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Dec 17 2013

%E Definition clarified by _Harvey P. Dale_, Apr 26 2014

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 April 16 12:36 EDT 2024. Contains 371711 sequences. (Running on oeis4.)