A349043 - OEIS

A349043

Number of solutions to n = s + t such that 1 <= s <= t and s | 2*t.

0, 0, 1, 1, 2, 2, 3, 2, 3, 3, 4, 2, 5, 2, 4, 5, 4, 2, 6, 2, 6, 5, 4, 2, 7, 4, 4, 5, 6, 2, 9, 2, 5, 5, 4, 6, 9, 2, 4, 5, 8, 2, 9, 2, 6, 9, 4, 2, 9, 4, 7, 5, 6, 2, 9, 6, 8, 5, 4, 2, 13, 2, 4, 9, 6, 6, 9, 2, 6, 5, 10, 2, 12, 2, 4, 9, 6, 6, 9, 2, 10, 7, 4, 2, 13, 6, 4, 5, 8, 2, 15, 6, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..20000

PROG

(PARI) a(n) = sum(s=1, n-1, ((n-s)>=s) && !(2*(n-s) % s)); \\ Michel Marcus, Nov 07 2021

CROSSREFS

Cf. A032741.

Sequence in context: A335454 A182745 A129843 * A330036 A050430 A277329

Adjacent sequences: A349040 A349041 A349042 * A349044 A349045 A349046

KEYWORD

nonn,easy

AUTHOR

Wesley Ivan Hurt, Nov 06 2021

STATUS

approved