This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082900 a(n) = A082894(n)-A000079(n), that is difference of 2^n and the number closest to it and divisible by n. 6
 0, 0, 1, 0, -2, 2, -2, 0, 1, -4, -2, -4, -2, -4, 7, 0, -2, 8, -2, 4, -8, -4, -2, 8, -7, -4, 1, 12, -2, -4, -2, 0, -8, -4, 17, 8, -2, -4, -8, -16, -2, 20, -2, -16, -17, -4, -2, -16, 19, -24, -8, -16, -2, 26, 12, 24, -8, -4, -2, -16, -2, -4, -8, 0, -32, 2, -2, -16, -8, 26, -2, 8, -2, -4, 7, -16, -18, 14, -2, -16, 1, -4, -2, 20, -32, -4, -8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS n=5:2^5=32 and number divisible by n=5 and closest to 32 is 30 = A082894(5), a(5)=30-32=-2 is the corresponding difference. LINKS FORMULA a(n)=n*floor[(floor(n/2)+2^n)/n]-2^n MATHEMATICA Table[n*Floor[(Floor[n/2]+2^n)/n]-2^n, {n, 1, 100}] CROSSREFS Cf. A082893-A082901. Sequence in context: A056557 A302986 A295305 * A171958 A301735 A133625 Adjacent sequences:  A082897 A082898 A082899 * A082901 A082902 A082903 KEYWORD sign AUTHOR Labos Elemer, Apr 22 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 01:08 EDT 2019. Contains 321479 sequences. (Running on oeis4.)