|
| |
|
|
A076478
|
|
Concatenate binary vectors of lengths 1, 2, 3, ... in numerical order.
|
|
7
| |
|
|
0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
REFERENCES
| K. Dajani and C. Kraaikamp, Ergodic Theory of Numbers, Math. Assoc. America, 2002, p. 72.
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
|
|
|
FORMULA
| To get a(n), write n+1 in base 2 and remove the initial 1. [from Clark Kimberling, Feb 07 2010]
|
|
|
EXAMPLE
| 0, 1; 0,0, 0,1, 1,0, 1,1; 0,0,0, 0,0,1, 0,1,0, 0,1,1, 1,0,0, 1,0,1, ...
|
|
|
MATHEMATICA
| d[n_] := Rest@IntegerDigits[n + 1, 2] + 1; -1 + Flatten[Array[d, 50]] (* see A076478, Clark Kimberling, Feb 07 2012 *)
|
|
|
PROG
| (PARI) {m=5; for(d=1, m, for(k=0, 2^d-1, v=binary(k); while(matsize(v)[2]<d, v=concat(0, v)); for(j=1, matsize(v)[2], print1(v[j], ", "))))}
(Haskell)
import Data.List (unfoldr)
a076478 n = a076478_list !! n
a076478_list = concat $ map (tail . reverse . unfoldr
(\x -> if x == 0 then Nothing else Just $ swap $ divMod x 2 )) [1..]
-- Reinhard Zumkeller, Feb 08 2012
|
|
|
CROSSREFS
| Cf. A007931.
Sequence in context: A117943 A096268 A079101 * A091444 A091447 A106701
Adjacent sequences: A076475 A076476 A076477 * A076479 A076480 A076481
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Nov 10 2002
|
|
|
EXTENSIONS
| Extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 11 2002
|
| |
|
|
