A084114 Number of divisions when calculating A084110(n).

0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 1, 2, 0, 1, 1, 2, 0, 2, 0, 1, 1, 1, 0, 3, 0, 1, 1, 1, 0, 2, 1, 2, 1, 1, 0, 4, 0, 1, 1, 2, 1, 2, 0, 1, 1, 2, 0, 4, 0, 1, 1, 1, 1, 2, 0, 3, 1, 1, 0, 4, 1, 1, 1, 2, 0, 4, 1, 1, 1, 1, 1, 4, 0, 1, 1, 2, 0, 2, 0, 2, 2

Offset: 1

Author

Reinhard Zumkeller, May 12 2003

Keywords

• nonn

Comments

a(n) = A000005(n) - 1 - A084113(n) = A032741(n) - A084113(n) = (A032741(n)-A084115(n))/2;

a(n) = 0 iff n is prime or a square of prime (A000430).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A080257.

Cf. A027750, A084110, A084113.

Programs

Haskell

a084114 = g 0 1 . tail . a027750_row where
   g c _ []     = c
   g c x (d:ds) = if r > 0 then g c (x * d) ds else g (c + 1) x' ds
                  where (x', r) = divMod x d
-- Reinhard Zumkeller, Jul 31 2014