|
| |
|
|
A057211
|
|
n-th run has length n.
|
|
11
| |
|
|
1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Seen as a triangle read by rows: T(n,k) = n mod 2, 1<=k<=n. [Reinhard Zumkeller, Mar 18 2011]
a(A007607(n)) = 0; a(A007606(n)) = 1. [Reinhard Zumkeller, Dec 30 2011]
|
|
|
REFERENCES
| K. H. Rosen, Discrete Mathematics and its Applications, 1999, Fourth Edition, page 79, exercise 10 (g).
|
|
|
LINKS
| Reinhard Zumkeller, Rows n=1..125 of triangle, flattened
Index entries for characteristic functions
|
|
|
FORMULA
| a(n) = (1-(-1)^A002024(n))/2, where A002024(n)=round(sqrt(2*n)). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003
Also a(n) = A000035(A002024(n)) = A002024(n) mod 2 = A002024(n)-2*floor(A002024(n)/2) - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003
|
|
|
MAPLE
| A002024 := n->round(sqrt(2*n)):A057211 := n->(1-(-1)^A002024(n))/2;
|
|
|
PROG
| (Haskell)
a057211 n = a057211_list !! (n-1)
a057211_list = concat $ zipWith ($) (map replicate [1..]) a059841_list
-- Reinhard Zumkeller, Mar 18 2011
|
|
|
CROSSREFS
| Cf. A057212.
Cf. A059841.
Sequence in context: A083035 A187074 A051341 * A120531 A106665 A004609
Adjacent sequences: A057208 A057209 A057210 * A057212 A057213 A057214
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Ben Tyner (tyner(AT)phys.ufl.edu), Sep 27 2000
|
| |
|
|
