|
| |
|
|
A117872
|
|
Parity of the iterated triangular numbers, using "2" as a seed.
|
|
4
| |
|
|
0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Suggested by D. R. Hofstadter.
|
|
|
FORMULA
| a(n) = mod(T^(n)(2), 2)
|
|
|
EXAMPLE
| a(1) = mod(T(2),2) = mod(3, 2) = 1.
a(4) = mod(T(T(T(T(2)))),2) = mod(231,2) = 1.
|
|
|
CROSSREFS
| Cf. A007501.
Sequence in context: A108737 A165221 A093879 * A089809 A165211 A096270
Adjacent sequences: A117869 A117870 A117871 * A117873 A117874 A117875
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Greg Huber (huber(AT)alum.mit.edu), May 13 2006, Feb 16 2007
|
|
|
EXTENSIONS
| More terms from Greg Huber (huber(AT)alum.mit.edu), Feb 16 2007
|
| |
|
|
