The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201651 Bit-interleaved number addition table (cf. A054240) as triangle read by rows: T(n,k) = n and k added in binary representation, where carries shift 2 instead of 1, 0 <= k <= n. 2
 0, 1, 4, 2, 3, 8, 3, 6, 9, 12, 4, 5, 6, 7, 16, 5, 16, 7, 18, 17, 20, 6, 7, 12, 13, 18, 19, 24, 7, 18, 13, 24, 19, 22, 25, 28, 8, 9, 10, 11, 12, 13, 14, 15, 32, 9, 12, 11, 14, 13, 24, 15, 26, 33, 36, 10, 11, 32, 33, 14, 15, 36, 37, 34, 35, 40, 11, 14, 33, 36 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..8000 EXAMPLE Triangle begins 0; 1, 4; 2, 3, 8; 3, 6, 9, 12; 4, 5, 6, 7, 16; PROG (Haskell) import Data.Bits (xor, (.&.), shift) a201651 :: Integer -> Integer -> Integer a201651 n 0 = n a201651 n k = a054240 (n `xor` k) (shift (n .&. k) 2) a201651_row n = map (a054240 n) [0..n] a201651_tabl = map a201651_row [0..] CROSSREFS Cf. A054240 (square array read by antidiagonals). Sequence in context: A143054 A195953 A016512 * A026246 A321122 A143051 Adjacent sequences:  A201648 A201649 A201650 * A201652 A201653 A201654 KEYWORD nonn,tabl AUTHOR Reinhard Zumkeller, Dec 03 2011 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 May 17 16:03 EDT 2021. Contains 343980 sequences. (Running on oeis4.)