|
Search: id:A142150
|
|
| |
|
| 0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 9, 0, 10, 0, 11, 0, 12, 0, 13, 0, 14, 0, 15, 0, 16, 0, 17, 0, 18, 0, 19, 0, 20, 0, 21, 0, 22, 0, 23, 0, 24, 0, 25, 0, 26, 0, 27, 0, 28, 0, 29, 0, 30, 0, 31, 0, 32, 0, 33, 0, 34, 0, 35, 0, 36, 0, 37, 0, 38, 0, 39, 0, 40, 0, 41, 0, 42, 0, 43, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
a(n) = XOR{k AND (n-k): 0<=k<=n}.
|
|
LINKS
|
R. Zumkeller, Logical Convolutions
|
|
FORMULA
|
a(n) = (n/2)*0^(n mod 2); a(2*n)=n and a(2*n+1)=0.
a(n)=Floor(n^2/2) mod n [From Barbarel Tres Mil (barbarel3000(AT)yahoo.es), Jul 29 2009]
a(n) = SUM((k mod 2)*((n-k) mod 2): 0<=k<=n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 05 2009]
|
|
MATHEMATICA
|
Table[Mod[Floor[n^2/2], n], {n, 1, 200}] [From Barbarel Tres Mil (barbarel3000(AT)yahoo.es), Jul 29 2009]
|
|
CROSSREFS
|
Cf. A003817, A000004, A142149, A086099, A142151, A001477.
A027656. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 05 2009]
Sequence in context: A108760 A137304 A027656 this_sequence A034948 A135472 A008723
Adjacent sequences: A142147 A142148 A142149 this_sequence A142151 A142152 A142153
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 15 2008
|
|
|
Search completed in 0.002 seconds
|
