|
| |
|
|
A135528
|
|
1, then repeat 1,0.
|
|
4
| |
|
|
1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 2-adic expansion of 1/3 (right to left) : 1/3 = ...01010101010101011 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 24 2009]
|
|
|
FORMULA
| a(n)=(1/2)*(1+(-1)^n)+(C(2*(n-1),(n-1)) mod 2). - Paolo P. Lava (paoloplava(AT)gmail.com), Mar 03 2008
G.f.: x*(1+x-x^2)/(1-x^2). - DELEHAM Philippe, Feb 08 2012
|
|
|
MAPLE
| GS(2, 1, 200); [see A135416].
|
|
|
PROG
| (Haskell)
a135528 n = a135528_list !! (n-1)
a135528_list = concat $ iterate ([1, 0] *) [1]
instance Num a => Num [a] where
fromInteger k = [fromInteger k]
(p:ps) + (q:qs) = p + q : ps + qs
ps + qs = ps ++ qs
(0:ps) * qs = 0 : ps * qs
(p:ps) * qs'@(q:qs) = p * q : ps * qs' + [p] * qs
_ * _ = []
-- Reinhard Zumkeller, Apr 02 2011
|
|
|
CROSSREFS
| Cf. A135416.
This is Guy Steele's sequence GS(2, 1) (see A135416).
Sequence in context: A073097 A117569 * A163805 A078387 A105470 A087429
Adjacent sequences: A135525 A135526 A135527 * A135529 A135530 A135531
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), based on a message from Guy Steele and D. E. Knuth, Mar 01 2008
|
| |
|
|
