This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A004514 Generalized nim sum n + n in base 4. 4
 0, 2, 0, 2, 8, 10, 8, 10, 0, 2, 0, 2, 8, 10, 8, 10, 32, 34, 32, 34, 40, 42, 40, 42, 32, 34, 32, 34, 40, 42, 40, 42, 0, 2, 0, 2, 8, 10, 8, 10, 0, 2, 0, 2, 8, 10, 8, 10, 32, 34, 32, 34, 40, 42, 40, 42, 32, 34, 32, 34, 40, 42, 40, 42, 128, 130, 128, 130, 136, 138, 136, 138, 128 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 FORMULA Generalized nim sum m + n in base q: write m and n in base q and add mod q with no carries, e.g. 5 + 8 in base 3 = "21" + "22" = "10" = 1. a(n) = 2*(n-a(floor(n/2))). a(n) = 2*A063694(n). - Vladeta Jovovic, Feb 23 2003 Equals A088442 - 1. - Chris Groer (cgroer(AT)math.uga.edu), Nov 10, 2003 a(n) = n + A053985(n). - Reinhard Zumkeller, Dec 27 2003 a(n) = A063695(2*n+1). - Reinhard Zumkeller, Sep 26 2015 PROG (Haskell) a004514 = a063695 . (+ 1) . (* 2)  -- Reinhard Zumkeller, Sep 26 2015 CROSSREFS Cf. A053985, A063694, A063695, A088442. Sequence in context: A029593 A196504 A182550 * A278748 A211930 A212026 Adjacent sequences:  A004511 A004512 A004513 * A004515 A004516 A004517 KEYWORD base,nonn AUTHOR EXTENSIONS More terms from Reinhard Zumkeller, Dec 27 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 December 15 01:20 EST 2018. Contains 318141 sequences. (Running on oeis4.)