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!)
A321164 Sum of distinct products b_1*b_2*...*b_n where 1<=b_i<=n. 1

%I #21 Nov 26 2020 09:15:59

%S 1,7,90,1441,38325,916714,37830100,1194352181,45241845825,

%T 1951734678972,147430334155104,5664495439368403,528359397843879784,

%U 30798685780200874044,1774211038440007650672,99969666291681633988821,13249072759407029981640765,847264606120975715873578180

%N Sum of distinct products b_1*b_2*...*b_n where 1<=b_i<=n.

%e a(2) = 1 + 2 + 4 = 7.

%e a(3) = 1 + 2 + 3 + 4 + 6 + 8 + 9 + 12 + 18 + 27 = 90.

%p a:= proc(m) option remember; local b; b:=

%p proc(n) option remember; `if`(n=0, {1},

%p map(x-> seq(x*i, i=1..m), b(n-1)))

%p end; forget(b); add(i, i=b(m))

%p end:

%p seq(a(n), n=1..12); # _Alois P. Heinz_, Jan 11 2019

%t a[m_] := a[m] = Module[{b}, b[n_] := b[n] = If[n==0, {1}, Map[Table[# i, {i, 1, m}]&, b[n-1]]] // Flatten // Union; b[m] // Total];

%t Array[a, 12] (* _Jean-François Alcover_, Nov 26 2020, after _Alois P. Heinz_ *)

%Y Main diagonal of A321163.

%Y Cf. A110713.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Jan 10 2019

%E a(15)-a(18) from _Alois P. Heinz_, Jan 11 2019

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)