login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241567 Number of 2-element subsets of {1,...,n} whose sum has more than 3 divisors. 0
0, 0, 0, 1, 3, 5, 8, 12, 17, 22, 29, 36, 44, 53, 62, 71, 82, 94, 107, 121, 135, 149, 165, 181, 198, 216, 234, 253, 274, 295, 317, 340, 364, 388, 413, 438, 464, 491, 519, 547, 577, 607, 639, 672, 705, 739, 775, 812, 850, 889, 928, 967, 1008, 1049, 1090, 1132, 1174, 1217, 1262, 1308 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

If the constraint on the number of divisors is dropped, one gets A000217 = triangular numbers n*(n+1)/2, which therefore is an upper bound.

If one considers 3-element subsets instead, one gets A241564; see the link there for the original motivation.

If one considers sums with more than 2 divisors, one gets A241566.

LINKS

Table of n, a(n) for n=1..60.

PROG

(PARI) a(n, m=2, 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: A310034 A014811 A282513 * A131674 A095173 A002579

Adjacent sequences:  A241564 A241565 A241566 * A241568 A241569 A241570

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 18:14 EST 2020. Contains 330987 sequences. (Running on oeis4.)