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

%I #28 Sep 08 2022 08:46:14

%S 1,1,2,1,2,4,2,10,38,58,902,35578,2080262,1906407418,67898268271622,

%T 141250085279900836858,269280339671247778784817867782,

%U 18283668752862244903904463537467802693858298,2582569770571288306580588933602503511656010789600193877369998342

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

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

%o (PARI) a(n) = if(n<4, fibonacci(n), (a(n-1)+a(n-2))*a(n-3)-a(n-1)) \\ _Altug Alkan_, Oct 08 2015

%o (Magma) I:=[1,1,2]; [n le 3 select I[n] else (Self(n-1)+ Self(n-2))*Self(n-3)-Self(n-1): n in [1..20]]; // _Vincenzo Librandi_, Oct 09 2015

%K nonn

%O 1,3

%A _Gianmarco Giordano_, Oct 08 2015

%E More terms from _Altug Alkan_, Oct 08 2015

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 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)