login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082494
a(n) = n - (2^n (mod n)).
3
1, 2, 1, 4, 3, 2, 5, 8, 1, 6, 9, 8, 11, 10, 7, 16, 15, 8, 17, 4, 13, 18, 21, 8, 18, 22, 1, 12, 27, 26, 29, 32, 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, 64, 33, 2, 65, 52, 61, 26, 69, 8, 71, 70, 7, 60, 59
OFFSET
1,2
LINKS
MAPLE
a:= n-> n-(2&^n mod n):
seq(a(n), n=1..100); # Alois P. Heinz, Apr 08 2015
CROSSREFS
KEYWORD
easy,nonn,look
AUTHOR
Anonymous, Apr 28 2003
STATUS
approved