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

%I #9 Dec 21 2023 15:05:35

%S 1,1,1,4,10,55,2269,1250284,156030444388,442641893445738546589,

%T 86351628807475712878787449679327520349,

%U 5963928033713995675288097975918984841058670353057557384156171322944994

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

%t a[1] = 1; a[2] = 1; a[3] = 1;

%t a[n_] := a[n] = a[n - 1]*a[n - 2]*a[n - 3] + a[n - 1] + a[n - 2] + a[n - 3];

%t Table[a[n], {n, 1, 12}]

%Y Cf. A063896 (a(n) = a(n-1)*a(n-2) + a(n-1) + a(n-2)), A000073.

%K nonn

%O 1,4

%A _José María Grau Ribas_, Nov 18 2023

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 15 10:04 EDT 2024. Contains 375173 sequences. (Running on oeis4.)