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!)
A225259 Number of distinct values of the sum of 2 products of three 0..n integers 1

%I #10 Mar 13 2021 01:15:19

%S 3,12,36,75,157,254,434,635,911,1237,1734,2162,2908,3611,4461,5435,

%T 6734,7879,9568,10964,12861,14913,17438,19426,22381,25251,28482,31624,

%U 35879,39100,44165,48267,53463,58590,64476,69214,76693,83132,90303,96766

%N Number of distinct values of the sum of 2 products of three 0..n integers

%H R. H. Hardin, <a href="/A225259/b225259.txt">Table of n, a(n) for n = 1..139</a>

%o (Python)

%o def a(n):

%o zn = list(range(n+1))

%o prod3 = list(set(i*j*k for i in zn for j in zn[i:] for k in zn[j:]))

%o return len(set(a+b for i, a in enumerate(prod3) for b in prod3[i:]))

%o print([a(n) for n in range(1, 42)]) # _Michael S. Branicky_, Mar 12 2021

%Y Row 2 of A225258.

%K nonn

%O 1,1

%A _R. H. Hardin_, May 04 2013

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 24 05:47 EDT 2024. Contains 371918 sequences. (Running on oeis4.)