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

%I #11 Jul 14 2024 16:00:30

%S 1,1,1,2,3,5,16,63,395,7328,486549,195081415,1433122040192,

%T 697379012200764243,136045964066902820948075525,

%U 194970470582876525091946983913863955456

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

%t RecurrenceTable[{a[1]==a[2]==a[3]==1,a[n]==a[n-3] (a[n-2]+a[n-1])},a,{n,20}] (* _Harvey P. Dale_, Jan 14 2012 *)

%t nxt[{a_,b_,c_}]:={b,c,a(b+c)}; NestList[nxt,{1,1,1},20][[;;,1]] (* _Harvey P. Dale_, Jul 14 2024 *)

%Y Cf. A048122.

%K nonn,easy

%O 1,4

%A _David Johnson-Davies_

%E More terms from _Patrick De Geest_, Jun 15 1999

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 August 5 00:22 EDT 2024. Contains 374934 sequences. (Running on oeis4.)