A374152 - OEIS

A374152

Number of divisors d of n such that d^(n/d) == d (mod (d + n/d)).

1, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 4, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 2, 2, 4, 2, 3, 2, 2, 4, 3, 2, 3, 3, 4, 2, 2, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 2, 2, 3, 6, 3, 3, 2, 2, 2, 2, 2, 2, 3, 2, 3, 5, 2, 3, 2, 2, 3, 3, 2, 2, 4, 2, 2, 2, 3, 2, 5

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

OFFSET

1,2

COMMENTS

For all n, the divisors counted in a(n) include 1 and n.

LINKS

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

EXAMPLE

a(8) = 3 because the divisors of 8 are 1, 2, 4 and 8, and

1^(8/1) == 1 (mod (1 + 8/1)),

4^(8/4) == 4 (mod (4 + 8/4)) and

8^(8/8) == 8 (mod (8 + 8/8)), but