login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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