cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A164349 The limit of the string "0, 1" under the operation 'repeat string twice and remove last symbol'.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1
Offset: 0

Views

Author

Jack W Grahl, Aug 13 2009

Keywords

Comments

We start with the string 01, at each step we replace the string by two concatenated copies and remove the last symbol.
01 -> 010 -> 01001 -> 010010100 etc.
Each string consists of 2^n + 1 symbols and clearly after this step the first 2^n + 1 symbols do not change.
Equivalently this sequence is given as follows: a(0) = 0, a(1) = 1, and for n>1, a(n) = first one of g(n), g(g(n)), g(g(g(n))).. etc. to be either 0 or 1, where g(n) = A053645(n-1).
The proportion of 0's in this sequence converges to a number close to 0.645059. The exact nature of this constant is not known. It is easy to show there are no 2 consecutive 1's.
Start of the first occurrence of k consecutive zeros: 0, 2, 7, 2046, > 8388600, ..., . - Robert G. Wilson v, Aug 17 2009
Start of the first occurrence of 5 consecutive zeros is > 2^34 - 5. Sum of the first 10^n terms b(n) begins: 0, 3, 36, 355, 3549, 35494, 354942, 3549412, 35494122, 354941215, 3549412151. - Alex Ratushnyak, Aug 15 2012
a(A246439(n)) = 1; a(A246438(n)) = 0. - Reinhard Zumkeller, Aug 28 2014
The partial sums appear to give A101402. - Arie Groeneveld, Aug 27 2014

Crossrefs

Programs

  • Haskell
    a164349 n = if n == 0 then 0 else until (<= 1) (a053645 . subtract 1) n
    -- Reinhard Zumkeller, Aug 28 2014
  • Mathematica
    Nest[ Most@ Flatten@ {#, #} &, {0, 1}, 7] (* Robert G. Wilson v, Aug 17 2009 *)
  • Perl
    my $ab = "10"; for (my $j = 1; $j < 30; $j++) { $ab .= $ab; substr $ab, -1, 1, ""; print "$ab\n"; }
    

Extensions

Spelling and notation corrected by Charles R Greathouse IV, Mar 23 2010

A246439 Numbers m such that A164349(m) = 1.

Original entry on oeis.org

1, 4, 6, 10, 13, 15, 18, 21, 23, 27, 30, 32, 34, 37, 39, 43, 46, 48, 51, 54, 56, 60, 63, 66, 69, 71, 75, 78, 80, 83, 86, 88, 92, 95, 97, 99, 102, 104, 108, 111, 113, 116, 119, 121, 125, 128, 130, 133, 135, 139, 142, 144, 147, 150, 152, 156, 159, 161, 163
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 28 2014

Keywords

Comments

A164349(a(n)) = 1.

Crossrefs

Cf. A246438 (complement), A101403 (first differences), A164349.

Programs

  • Haskell
    a246439 n = a246439_list !! (n-1)
    a246439_list = filter ((== 1) . a164349) [0..]
Showing 1-2 of 2 results.