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!)
A000308 a(n) = a(n-1)*a(n-2)*a(n-3) with a(1)=1, a(2)=2 and a(3)=3. 4

%I #19 Feb 01 2022 00:52:27

%S 1,2,3,6,36,648,139968,3265173504,296148833645101056,

%T 135345882205792807436868315512832,

%U 130876399105969522361889021452224949874232743897657526714368

%N a(n) = a(n-1)*a(n-2)*a(n-3) with a(1)=1, a(2)=2 and a(3)=3.

%H John Cerkan, <a href="/A000308/b000308.txt">Table of n, a(n) for n = 1..15</a>

%F a(n) = 2^A001590(n-1)*3^A000073(n-1). - _Henry Bottomley_, Jul 16 2001

%e a(6)=36*6*3=648.

%p A000308 := proc(n) option remember; if n <=3 then n else A000308(n-1)*A000308(n-2)*A000308(n-3); fi; end;

%Y Cf. A000304, A000336, A063401.

%K nonn

%O 1,2

%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 May 3 07:04 EDT 2024. Contains 372206 sequences. (Running on oeis4.)