A082493 a(n) = n*ceiling(2^n/n) - 2^n.

0, 0, 1, 0, 3, 2, 5, 0, 1, 6, 9, 8, 11, 10, 7, 0, 15, 8, 17, 4, 13, 18, 21, 8, 18, 22, 1, 12, 27, 26, 29, 0, 25, 30, 17, 8, 35, 34, 31, 24, 39, 20, 41, 28, 28, 42, 45, 32, 19, 26, 43, 36, 51, 26, 12, 24, 49, 54, 57, 44, 59, 58, 55, 0, 33, 2, 65, 52, 61, 26, 69, 8, 71, 70, 7, 60, 59, 14

Offset

1,5

Comments

Least nonnegative k such that (2^n+k)/n is an integer.

If n is a power of 2, a(n) = 0; otherwise a(n) = n - A015910(n). - Robert Israel, Apr 08 2015

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Formula

a(n) = -(2^n) mod n. - Robert Israel, Apr 08 2015

Maple

seq(-2&^n mod n, n = 1 .. 100); # Robert Israel, Apr 08 2015

Prog

(Python)
def A082493(n): return (-pow(2, n, n))%n # Chai Wah Wu, Aug 24 2023

Crossrefs

Cf. A053638, A015910, A000799, A082494, A215747.

Sequence in context: A355776 A318304 A318989 * A323912 A021887 A085015

Adjacent sequences: A082490 A082491 A082492 * A082494 A082495 A082496

Keyword

easy,nonn,look

Author

Vladeta Jovovic, Apr 28 2003

Status

approved