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!)
A241564 Number of 3-element subsets of {1,...,n} whose sum has more than 3 divisors. 4
0, 0, 1, 2, 6, 11, 22, 35, 55, 78, 110, 145, 192, 245, 312, 386, 476, 572, 684, 804, 943, 1091, 1261, 1442, 1647, 1864, 2108, 2366, 2651, 2951, 3281, 3629, 4010, 4410, 4845, 5299, 5790, 6301, 6850, 7420, 8031, 8665, 9342, 10043, 10788, 11559, 12375, 13215 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
If the constraint on the number of divisors is dropped, one gets A000292 = tetrahedral numbers C(n+2,3) = n*(n+1)*(n+2)/6, which therefore is an upper bound.
If the subsets with more than 2 divisors are counted, one gets A241563.
LINKS
W. E. Clark in reply to A. Hatzipolakis, A generalization, SeqFan list, Apr 24 2014
MAPLE
N:= 100: # for a(1)..a(N)
t:= 0: R:= NULL:
for n from 1 to N do
v:= select(s -> numtheory:-tau(s+n)>3, [$2..2*n-3]);
t:= t + add(floor((s-1)/2) - max(0, s-n) , s = v);
R:= R, t;
od:
R; # Robert Israel, Jan 04 2021
PROG
(PARI) a(n, m=3, d=3)={s=0; u=vector(m, n, 1)~; forvec(v=vector(m, i, [1, n]), numdiv(v*u)>d&&s++, 2); s}
CROSSREFS
Sequence in context: A085571 A007684 A296557 * A135348 A305101 A363936
KEYWORD
nonn
AUTHOR
M. F. Hasler, Apr 25 2014
STATUS
approved

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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)