Million-to-Collatz Challenge!!
The goal is to find the smallest number you can that would take exactly $1,000,000$ steps to get to $1$ under the standard Collatz procedure with no skips i.e. $3n+1$ if $n$ is odd...
Search fresh public links, source activity, and post angles for A000660.
Fresh curated links around A000660 are collected here so marketers can spot useful updates and turn timely ideas into posts faster.
Recent items include:
Recent curated links from global sources. Generate one free draft from any story, then use SocialBu to schedule and refine your content calendar.
The goal is to find the smallest number you can that would take exactly $1,000,000$ steps to get to $1$ under the standard Collatz procedure with no skips i.e. $3n+1$ if $n$ is odd...
What's the hidden final answer?
I have two sequences for you. Here is the start of each: A stricter version: 5, 0, 0, 0, 6, 11, 8, 2, 4, 0 [...] A lenient version: 9, 0, 0, 0, 13, 15, 14, 7, 7, 0 [...] And in c...
I have an annoying coworker named Theodore. Theodore likes sequences. At lunch, he handed me this: AAA = (2,1) (9,4) (38,17) ABC = (2,1) (38,17) (682,305) BAA = (9,4) (9,4) (38,17)...
Use SocialBu to discover ideas, generate post drafts, and schedule them across your social channels.