Start with the number 512. Then at each step take the number generated, and add it to the number obtained by reversing its base 2 digits. The pattern produced appears never to terminate. Very little is known about it.
THINGS TO TRY
the Wolfram Demonstrations Project
Embed Interactive Demonstration
More details »
Download Demonstration as CDF »
Download Author Code »
More by Author
Creating a GCD Grid
Randomness in the Digits of Square Roots
Randomness in the Digits of Pi
Linear Congruential Sequences
Multiterm Nestedly Recursive Functions
One-Term Nestedly Recursive Functions
Integer Trig Hunt
Michael Trott with permission of Springer
3n+1 Flying Saucers
The 196 Algorithm, Reorder-and-Add Algorithm, and RATS Sequence in Different Bases
NKS / Wolfram Science
Browse all topics
The #1 tool for creating Demonstrations
and anything technical.
Explore anything with the first
computational knowledge engine.
The web's most extensive
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
STEM Initiative »
Programs & resources for
educators, schools & students.
Join the initiative for modernizing
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
© 2017 Wolfram Demonstrations Project & Contributors |
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