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”).

A083508
Number of distinct products i*j*k with 1 <= i < j <= k <= n.
0
0, 0, 2, 7, 16, 24, 40, 56, 77, 96, 137, 158, 214, 249, 284, 322, 418, 464, 583, 645, 708, 774, 946, 1007, 1125, 1220, 1330, 1420, 1685, 1768, 2069, 2203, 2346, 2492, 2658, 2750, 3166, 3362, 3553, 3675, 4183, 4344, 4909, 5129, 5327, 5575, 6252, 6432, 6849
OFFSET
1,3
PROG
(PARI) for(n=1, 100, s=Set(); for(i=1, n-2, for(j=i+1, n-1, for(k=j, n, p=i*j*k; if(!setsearch(s, p), s=setunion(s, Set(p)))))); print1(length(s), ", ")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 06 2006
CROSSREFS
Sequence in context: A041341 A296857 A229595 * A048231 A357577 A070169
KEYWORD
nonn
EXTENSIONS
Better definition and more terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 06 2006
STATUS
approved