10922
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Baum-Sweet Sequence
The
term in the Baum-Sweet sequence is 1 if the length of every block of consecutive zeros in the binary expansion of
is even, and 0 otherwise.
A recurrence plot is a view of a moment in time for a phase space, which illustrates all the times when the same area in the phase space is visited.
Contributed by:
Daniel de Souza Carvalho
Based on a program by:
Eric W. Weisstein
SNAPSHOTS
RELATED LINKS
Recurrence Plot
(
Wolfram
MathWorld
)
Baum–Sweet Sequence
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Baum-Sweet Sequence
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BaumSweetSequence/
Contributed by:
Daniel de Souza Carvalho
Based on a program by:
Eric W. Weisstein
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Farey Sequence
Enrique Zeleny
Convergence of a Recursive Sequence
Soledad María Sáez Martínez and Félix Martínez de la Rosa
The Sequence of Primes
Abigail Nussey
Collatz Sequence Computed by a Turing Machine
Emmanuel Garces Medina
Collatz Sequence Computed by a Tag System
Emmanuel Garces Medina
Correlating the Mertens Function with the Farey Sequence
Jenda Vondra
Golomb Rulers and Fibonacci Sequences
Ed Pegg Jr
Successive Differences of Sequences
George Beck
Other Formulations of the Collatz Problem
Enrique Zeleny
Discrepancy Conjecture
Ed Pegg Jr
Related Topics
Number Theory
Sequences
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+