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!)
A343879 Number of pairs (d1, d2) of divisors of n such that d1<d2, d1|n, d2|n, d1|d2 and d1 + d2 <= n. 0
0, 0, 0, 1, 0, 2, 0, 3, 1, 2, 0, 7, 0, 2, 2, 6, 0, 7, 0, 7, 2, 2, 0, 15, 1, 2, 3, 7, 0, 12, 0, 10, 2, 2, 2, 19, 0, 2, 2, 15, 0, 12, 0, 7, 7, 2, 0, 26, 1, 7, 2, 7, 0, 15, 2, 15, 2, 2, 0, 31, 0, 2, 7, 15, 2, 12, 0, 7, 2, 12, 0, 37, 0, 2, 7, 7, 2, 12, 0, 26, 6, 2, 0, 31, 2, 2, 2, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
a(n) = 0 if and only if n is noncomposite.
LINKS
FORMULA
a(n) = Sum_{k=1..floor(n/2)} Sum_{i=1..k-1} c(k/i) * c(n/k) * c(n/i), where c(n) = 1 - ceiling(n) + floor(n).
EXAMPLE
a(12) = 7; The 7 pairs are (1,2), (1,3), (1,4), (1,6), (2,4), (2,6), (3,6).
MATHEMATICA
Table[Sum[Sum[(1 - Ceiling[k/i] + Floor[k/i]) (1 - Ceiling[n/k] + Floor[n/k]) (1 - Ceiling[n/i] + Floor[n/i]), {i, k - 1}], {k, Floor[n/2]}], {n, 100}]
PROG
(PARI) a(n) = sumdiv(n, d1, sumdiv(n, d2, if ((d1 < d2) && (d1+d2 <= n) && !(d2 % d1), 1))); \\ Michel Marcus, May 02 2021
CROSSREFS
Cf. A343877.
Sequence in context: A071465 A333409 A197117 * A275387 A051709 A318326
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 02 2021
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 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)