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!)
A123703 a(1)=a(2)=1. For n >= 3, a(n) = |(product{k=1 to n-1} a(k)) - (sum{j=1 to n-1} a(j))|. 1

%I #10 Oct 11 2019 12:31:19

%S 1,1,1,2,3,2,2,12,264,75744,5758891776,33165272341980979200,

%T 1099935289708766240667530888404210286592,

%U 1209857641546707521062997518664689369471121315619387834957574646785625397657600

%N a(1)=a(2)=1. For n >= 3, a(n) = |(product{k=1 to n-1} a(k)) - (sum{j=1 to n-1} a(j))|.

%t f[l_List] := Append[l, Abs[Times @@ l - Plus @@ l]];Nest[f, {1, 1}, 12] (* _Ray Chandler_, Oct 09 2006 *)

%Y Cf. A123702.

%K easy,nonn

%O 1,4

%A _Leroy Quet_, Oct 08 2006

%E Extended by _Ray Chandler_, Oct 09 2006

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 April 25 13:33 EDT 2024. Contains 371971 sequences. (Running on oeis4.)