This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003796 Numbers with no 3 adjacent 0's in binary expansion. 10
 0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 David Garth and Adam Gouge, Affinely Self-Generating Sets and Morphisms, Journal of Integer Sequences, Article 07.1.5, 10 (2007) 1-13. Chai Wah Wu, Record values in appending and prepending bitstrings to runs of binary digits, arXiv:1810.02293 [math.NT], 2018. MATHEMATICA Select[Range[0, 100], SequenceCount[IntegerDigits[#, 2], {0, 0, 0}]==0&] (* The program uses the SequenceCount function from Mathematica version 10 *) (* Harvey P. Dale, Sep 12 2015 *) PROG (Haskell) a003796 n = a003796_list !! (n-1) a003796_list = filter f [0..] where    f x  = x < 4 || x `mod` 8 /= 0 && f (x `div` 2) -- Reinhard Zumkeller, Jul 01 2013 (PARI) is(n)=while(n>7, if(bitand(n, 7)==0, return(0)); n>>=1); 1 \\ Charles R Greathouse IV, Feb 11 2017 CROSSREFS Complement of A004779. Cf. A004745 (no 001), A004746 (no 010), A004744 (no 011), A003754 (no 100), A004742 (no 101), A004743 (no 110), A003726 (no 111). Cf. A063037, A007088. Sequence in context: A188437 A325456 A328161 * A032896 A032855 A031993 Adjacent sequences:  A003793 A003794 A003795 * A003797 A003798 A003799 KEYWORD nonn,base,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 07:15 EDT 2019. Contains 327995 sequences. (Running on oeis4.)