|
Search: id:A073424
|
|
|
| A073424 |
|
Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n |
|
+0
4
|
|
| 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Parity of the sums of two powers of any even number.
|
|
FORMULA
|
a(n) = parity [ (2k)^n + (2k)^m, n = 0, 1, 2, 3 ..., m = 0, 1, 2, 3, ... n ]
|
|
EXAMPLE
|
a(3) = 1 because (2k)^2 + (2k)^0 = 4k^2 + 1 is odd.
|
|
CROSSREFS
|
Cf. A023531, A010054, A073423.
Sequence in context: A083923 A101309 A141474 this_sequence A135993 A145573 A092202
Adjacent sequences: A073421 A073422 A073423 this_sequence A073425 A073426 A073427
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), Jul 30 2002
|
|
|
Search completed in 0.002 seconds
|
