login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A087849 A075015 A205558 * A194187 A174375 A110663
KEYWORD
easy,nonn,look
AUTHOR
Anonymous, Apr 28 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 07:58 EDT 2024. Contains 372009 sequences. (Running on oeis4.)