Tanya Khovanova's Math Blog

I bought the book “Math Doesn’t Suck: How to Survive Middle School Math Without Losing Your Mind or Breaking a Nail“ by Danica McKellar because I couldn’t resist the title. Sometimes this book reads like a fashion magazine for girls: celebrities, shopping, diet, love, shoes, boyfriends. At the same time it covers elementary math: fractions, percents and word problems.

You can apply math to anything in life. Certainly you can apply it to fashion and shoes. I liked the parallel between shoes and fractions that Danica used. She compared improper fractions to tennis shoes and mixed numbers to high heels. It is much easier to work with improper fractions, but mixed numbers are far more presentable.

Danica is trying to break the stereotype that girls are not good at math by feeding all the other stereotypes about girls. If you are a typical American girl who hates math and missed some math basics, this book is for you. If you want to discover whether the stars are on your side when you are learning math, the book even includes a math horoscope.

I am celebrating the first hundred essays I have written for my blog. My English teacher and editor Sue Katz edited most of them. Sue Katz not only corrects my English mistakes, but also helps me to choose better and more descriptive words and rearranges my text so that it doesn’t sound like a direct translation from Russian.

If you’re looking for an editor, she’s superb.

Sue is an extremely interesting person. She was one of the first women to gain a black belt in Tae Kwon Do and taught martial arts and dance on three continents. Now she concentrates on her blog and writing. In her blog Sue Katz: Consenting Adult she writes a lot about sex and also about current affairs. She reviews books and movies and expresses her interesting and unique perspective on things. Some of my favorite posts:

• Philosophical and romantic — Six-Word Memoirs: Sought revolution, got pantsuits, want more
• Down-to-earth and funny — The Drip Dominatrix rules her bladder
• Bitter and sweet — Film Review: The Diving Bell and the Butterfly

I am not only grateful to Sue for the excellent professional job, but also for encouraging me. She laughs at my jokes and is a devoted fan of my blog. Thank you, Sue!

I love “Knights and Knaves” logic puzzles. These are puzzles where knights always tell the truth and knaves always lie. A beautiful variation of such a puzzle with Gnyttes and Mnaivvs was given at the 2009 MIT mystery hunt. In this puzzle people’s ability to tell the truth changes during the night depending on the sex partner. You will enjoy figuring out who is a Gnytte or a Mnaivv for each day, who is infected and who slept with whom on each night. Just remember that the ultimate answer to the puzzle is a word or a phrase. So there is one more step after you solve the entire logic part. You do not really need to do this last step, but you might as well. Here we go:

The Sexaholics of Truthteller Planet

Each inhabitant of Veritas 7, better known as the Truthteller Planet, manifests one of two mutations: Gnytte or Mnaivv. Gnyttes always tell the truth, and Mnaivvs always lie. Once born a Gnytte or Mnaivv, the inhabitant can never change…until now.

Veritas 7 is in the midst of an outbreak of a nasty virus dubbed Nallyums Complex II. If an infected inhabitant has sex with another inhabitant of that planet, each one can be converted from Gnytte to Mnaivv, or Mnaivv to Gnytte, as shown below:

• If the sex is heteroverific (1 Gnytte and 1 Mnaivv), both become Mnaivvs.
• If the sex is homoverific (2 Gnyttes or 2 Mnaivvs), both become Gnyttes.

This occurs if either party or both parties have the disease. The disease itself is not transmitted via sex, which is some relief.

Several members of a Veritas 7 village have just contracted Nallyums Complex II. Below are statements from the 15 village residents, taken over the 5-day period since the outbreak. Interviews were taken each morning, and sex occured only at night. Each night, residents paired off to form seven separate copulating couples, with one individual left out. No individual was left out for more than one night.

Can you identify the infected individuals and track their pattern of sexual activity?

A note on wording: If someone refers to sex with someone who was a Gnytte or Mnaivv, they are referring to the individual’s truth-telling status just before sex. If a clue says that two individuals had sex, it means they had sex with each other. “Mutation” refers to the individual’s current status as Gnytte or Mnaivv.

Interviews Day 1

• Artoo: Etrusco is not infected.
• Bendox: Cravulon and Flav are not the same mutation today.
• Cravulon: Either Artoo or Flav is a Gnytte today.
• Dent: Jax-7 and I are both Mnaivvs today.
• Etrusco: Greasemaster is a Mnaivv today.
• Flav: There are at least five Mnaivvs today.
• Greasemaster: Murgatroid is a Gnytte today.
• Holyoid: Etrusco is either an infected Mnaivv or an uninfected Gnytte today.
• Irono: Etrusco is a Mnaivv today.
• Jax-7: Among Artoo, Greasemaster, and Nebulose, exactly one is a Gnytte today.
• Killbot: Bendox is a Gnytte today.
• Lexx: Holyoid and Irono are not the same mutation today.
• Murgatroid: There are at least eight Gnyttes today.
• Nebulose: Murgatroid is a Mnaivv today.
• Oliver: Lexx is a Gnytte today.

Surveillance Night 1

Security cameras revealed that Jax-7 did not have sex with anyone last night, and that Nebulose and Murgatroid had sex.

Interviews Day 2

• Artoo: Last night, I did not have sex with an infected individual.
• Bendox: Last night, Oliver had sex with someone who was a Mnaivv.
• Cravulon: There are at least six Gnyttes today.
• Dent: If there are only five Gnyttes today, then Cravulon and Oliver had sex last night.
• Etrusco: Last night, Bendox had sex with someone who was a Mnaivv.
• Flav: Neither Killbot nor her partner last night is infected.
• Greasemaster: Last night, either Cravulon and Bendox had sex, or Oliver and Etrusco had sex, but not both.
• Holyoid: Last night, I had sex with someone who was a Gnytte.
• Irono: Last night, I did not have sex with Flav.
• Jax-7: Last night, Artoo had sex with Dent.
• Killbot: Last night, I had sex with someone who was a Mnaivv.
• Lexx: Cravulon is infected.
• Murgatroid: Nebulose is not infected.
• Nebulose: Last night, either Cravulon or Flav had sex with Etrusco.
• Oliver: Last night, Irono had sex with someone who was a Mnaivv.

Surveillance Night 2

Security cameras revealed that Holyoid did not have sex with anyone last night, and that Irono and Oliver had sex.

Interviews Day 3

• Artoo: Last night, I had sex with the individual who had sex with Murgatroid on Night 1.
• Bendox: Last night, I had sex with an uninfected individual.
• Cravulon: Last night, Jax-7 had sex with the individual who had sex with Lexx on Night 1.
• Dent: Last night, I had sex with someone who was a Mnaivv.
• Flav: Last night, I had sex with an uninfected individual.
• Holyoid: Neither Oliver nor Irono is infected.
• Irono: Last night, the individual who had sex with Oliver on Night 1 had sex with someone who was a Mnaivv.
• Jax-7: There are more than seven Gnyttes today.
• Killbot: Bendox and Murgatroid are the same mutation today.
• Lexx: Last night, the individual who had sex with Flav on Night 1 had sex with an infected individual.
• Nebulose: The individual who had sex with Etrusco on Night 1 is a Mnaivv today.
• Oliver: Last night, Lexx had sex with the individual who had sex with Bendox on Night 1.

Surveillance Night 3

Security cameras revealed that Dent and Jax-7 had sex.

Interviews Day 4

• Artoo: There are at most seven Gnyttes today.
• Cravulon: Last night, I had sex with someone who has never been a Gnytte.
• Dent: The two sex partners of an individual who was a Mnaivv on the first three days had sex last night.
• Etrusco: Last night, Oliver did not have sex.
• Flav: Last night, I had sex with an infected individual.
• Greasemaster: There are exactly eight infected individuals.
• Killbot: None of the individuals who have been left out of the sexual activity is infected.
• Murgatroid: Last night, I had sex with someone who was a Gnytte on Day 1.
• Nebulose: Last night, I had sex with someone who has had sex with Artoo.
• Oliver: Last night, an individual who had sex with Holyoid during one of the first two nights had sex with an individual who had sex with Jax-7 during one of the first two nights.

Surveillance Night 4

Security cameras have been vandalized.

Interviews Day 5

• Artoo: Last night, I had sex with a Mnaivv, but not the individual who, on Night 3, had sex with the individual who, on Night 2, had sex with the individual who, on Night 1, had sex with Dent.
• Bendox: Last night, Dent had sex with the individual who, on Night 1, had sex with the individual who, on Night 3, had sex with the individual who, on Night 2, had sex with Artoo.
• Cravulon: Last night, Holyoid had sex with the individual who, on Night 3, had sex with the individual who, on Night 2, had sex with the individual who, on Night 1, had sex with Murgatroid.
• Dent: Jax-7 is a Gnytte today.
• Flav: Last night, Cravulon did not have sex with the individual who, on Night 1, had sex with the individual who, on Night 2, had sex with the individual who, on Night 3, had sex with Cravulon.
• Jax-7: Last night, Greasemaster did not have sex.
• Nebulose: Last night, Killbot either had sex with an uninfected individual or did not have sex.

I do not remember where I dug this logic puzzle out from:

Folks living in Trueton always tell the truth. Those who live in Lieberg, always lie. People living in Alterborough alternate strictly between truth and lie. One night 911 got a call: “Fire, help!” The operator couldn’t identify the phone number, so he asked, “Where are you calling from?” The reply was Lieberg.
Assuming no one had overnight guests from another town, where should the firemen go?

After you have solved this problem, you will see that the sentence “Fire, help!” is true. I wonder, if this statement were a lie, how would we interpret it? It could be that it is just a joke and there is no fire and therefore no need for the police. Or it could be that help is needed — perhaps for a robbery, but not for a fire.

However, when you solve this puzzle, you’ll find out that the “Fire, help!” statement is true, so you do not need to wonder what it would mean if the statement were a lie. But I wondered, and as a result I invented several new puzzles.

Here is the first one:

Let’s say that people will call the police only if something is happening and there are only two things that could be happening: fire or robbery. Suppose that when people calling the police need to lie, they replace fire with robbery, and vice versa. Suppose also that when asked about location, people will not say, &quotI am not from Lieberg,” as they could have, but will always reply with one word, which is a name of one of three towns. So, there are two possibilities for the first statement — Fire, Help! or Robbery, Help! — and three possible answers to the question about location. — Trueton, Lieberg and Alterborough. My puzzle in this case is: What answer to the location question will give the biggest headache to the police?

We can branch the original puzzle out in a different way. Here is my second puzzle:

We can assume that only fire, not robbery, could happen in this remote place and when people call the police they either say “Fire, help!” or “We do not have a fire, thank you for your time.” Let us again assume that people will call the police only if something is happening. In this case, what combinations of first and second sentences of the callers will never happen?

My third puzzle is a more complicated version of the second puzzle:

Let’s assume that fires happen with the same probability in every town and that the cost of sending a team of firefighters is identical for every town. Furthermore, the ferocity of all the fires is minuscule and the cost of sending a team is the same, whether or not it turns out that there is a fire. If the police think that the call could have come from several places, they send several teams and the cost multiplies accordingly. The police are obsessed with making charts and the most important number they analyze is the cost they incur, depending on the content of the first sentence of each call.
Given that there are frequent fires, what could the ratio of the cost to police for the calls “Fire, help!” be compared to those that begin with “We do not have a fire, thank you for your time”?

I wanted to see how different presidents affected the Dow Jones index. The index was invented at the end of the nineteenth century, so for my convenience, I will start my analysis from the beginning of the twentieth century. I skipped the presidents who were in office for only four years — four years might not be enough to rebuild a bad economy or to destroy a good one. Besides, in order to give the presidents a fair chance, I compared them for the same time period: eight years.

So I removed from my consideration all those who only served for four years: William Howard Taft, Herbert Hoover, Jimmy Carter and George H.W. Bush. I also combined two presidents together, when one succeeded the other mid-term for a total of eight years. Namely, I combined Warren Harding with Calvin Coolidge, John Kennedy with Lyndon Johnson, and Richard Nixon with Gerald Ford. For Franklin Roosevelt, I only considered the first eight years of his presidency.

Please note that it was not always precisely eight years — the inauguration date was sometimes moved. So Theodore Roosevelt and Harry Truman had slightly less than eight years. I tried to use the Dow Jones index from the exact day of each inauguration, but not all the dates were available in the file I used. So sometimes I had to pick the previous day.

Some might argue that I need to scale the Dow Jones Index. For example, the inflation rate was very different for different presidents. It is generally accepted that the value of one point in the Dow Jones Index decreases with time, but inflation is only one of many elements contributing to that change. Nonetheless, I took a look at that and the resulting picture didn’t change much anyway when I adjusted for inflation.

The Dow Jones is just one number. An increase in the Dow Jones does not completely describe the state of the economy, but it is certainly an interesting measure in its own right.

Let’s look at how the presidents and the presidential teams performed, sorting them from best to worst:

When I started this calculation I expected Clinton to be doing well and Bush badly, I just didn’t know exactly how good/bad they were. But the most interesting result of this exercise is the fact that the highest increase in DJI happened right before the Great Depression.

What can I say? I should have done this analysis eight years ago. Maybe the proximity of Clinton’s performance to the pre-depression boom could have urged me to move my 401(k) from stocks. Sigh.

The computational linguistics Olympiad started in Moscow in 1962. I first participated when I was in seventh grade. The Olympiad had two sets of problems: the first set was more difficult and meant for seniors, and the second set was for everyone else. Although the sets overlapped, they were significantly different. I should mention that the Soviet Union had 10 grades at that time and prizes were awarded by grade.

I achieved my best result when I was in ninth grade, just below the senior level. During the competition, I solved all the problems for non-seniors and still had a lot of time left. Luckily for me, both sets of problems were in the same booklet, so I proceeded to solve the problems for seniors.

I won two first place prizes: for my ninth grade and for the tenth grade, too.

The following year I was in tenth grade and I felt strange. I couldn’t compete on two levels as I was overqualified for non-seniors. So it was impossible to repeat my result. I could only go downhill — winning only one first place in the best case. So, I didn’t go to the competition at all.

Someone told me that I was arrogant not to go. But what they didn’t know was that I hadn’t been able to stop worrying: what if I didn’t win first place? All my friends cheered me on during my competitions, and I was afraid to let them down. To this day I can remember my fear of performing worse than the year before.

The organizers of the computational linguistics Olympiad had another reason to think I was arrogant. After my successes, they tried to persuade me to go into linguistics. I actually considered that until someone told me that all the computational linguistics majors are later employed by the KGB. The minute I heard that, I lost all interest in linguistics for many years to come. I told the organizers that all my success was due to my impeccable logic, not to my linguistics ability, so there was no point for me to go into linguistics. My arrogance was reaffirmed.

Recently my son Sergei started to compete in the computational linguistics Olympiad, which reminded me of how interesting linguistics can be. I wonder if Sergei will get a call from the CIA.

Computational Linguistics Olympiads started in Moscow in 1962. Finally in 2007 the US caught up and now we have the NACLO — North American Computational Linguistics Olympiad.

The problems from past Soviet Olympiads are hard to find, so here I present a translation from Russian of a sample problem from the Moscow Linguistics Olympiad website:

You are given sentences in Niuean language with their translations into English:

1. To lele e manu. — The bird will fly.
2. Kua fano e tama. — The boy is walking.
3. Kua koukou a koe. — You are swimming.
4. Kua fano a ia. — He is walking.
5. Ne kitia he tama a Sione. — The boy saw John.
6. Kua kitia e koe a Pule. — You are seeing Pule.
7. To kitia e Sione a ia. — John will see him.
8. Ne liti e ia e kulï. — He left the dog.
9. Kua kai he kulï e manu. — The dog is eating the bird.

Translate the following sentences into Niuean:

1. John swam.
2. You will eat the dog.
3. Pule is leaving you.
4. The bird will see the boy.
5. The dog is flying.

I was interested for some time in the divisibility of odd Fibonacci numbers. Fibonacci numbers are closely related to Lucas numbers. Lucas numbers L_n follow the same recurrence as Fibonacci numbers: L_n = L_n-1 + L_n-2, but with a different start: L₀ = 2, L₁ = 1. Obviously, every third Fibonacci and every third Lucas number is even.

Primes that divide odd Lucas numbers divide odd Fibonacci numbers. Let us prove this. Suppose a prime p divides an odd Lucas number L_k, then we can use the famous identity F_2k = F_kL_k. We see that p divides F_2k. The fact that L_k is odd means that k is not divisible by 3 and so is 2k. Thus F_2k is an odd Fibonacci that is divisible by p.

We see that primes that divide odd Lucas numbers are a subset of primes dividing odd Fibonacci numbers. It is easy to see that it is a proper subset. The smallest prime that divides an odd Fibonacci and doesn’t divide any Lucas number is 5.

The next natural question to ask: is there a prime number that divides an odd Fibonacci, doesn’t divide an odd Lucas number, but divides an even Lucas number? Below I show that such a prime doesn’t exist. In other words, that the set of prime factors of odd Lucas numbers is the intersection of the set of prime factors of odd Fibonacci numbers with the set of prime factors of all Lucas numbers.

Let us consider a Fibonacci-like sequence a_n in a sense that a_n = a_n-1 + a_n-2 for n > 1. Let me denote by b_n, the sequence that is a_n modulo a prime number p. The sequence b_n has to be periodic. It could happen that b_n is never 0. For example, Lucas numbers are never divisible by 5. Suppose the sequence b_n contains a zero. Let us denote r(p) the difference between the indices of two neighboring zeroes in b_n. We can prove that r(p) is well-defined, meaning that is doesn’t depend on where you choose your neighboring zeroes. Moreover r(p) doesn’t depend on the sequence you start with (see 9 Divides no Odd Fibonacci for the proof). The number r(p) is called the rank of apparition of the prime p.

As the Fibonacci sequence starts with a zero, then the terms divisible by a prime p are exactly the terms with indices that are multiples of the corresponding rank of apparition. The Lucas sequence doesn’t start with a zero, but we know that L_-n = (-1)ⁿL_n. That means, if a Lucas number is ever divisible by a prime p, then the smallest positive index for such a number has to be r(p)/2. Also, the indices of the Lucas numbers divisible by p will be odd multiples of r(p)/2.

We know that the indices of even Fibonacci or Lucas numbers are multiples of 3. Hence, a prime number p that divides an odd Fibonacci number must have a rank of apparition that is not divisible by 3, That means that if p ever divides a Lucas number, then it divides a Lucas number with an index of r(p)/2, which is not divisible by 3, meaning that p divides an odd Lucas number. QED.

My Number Gossip website is becoming very popular. Recently the number of visits increased significantly. I decided to use my Google Analytics software to check the sources of this traffic.

The first spike in visits came after the link to my website appeared on the site PointlessSites.com. Never underestimate bad publicity.

But the real increase was due to the following description of my website at CollegeHumor.com:

Don’t even get me started on number 7! Number gossip. All the dirt on your favorite numbers, like 5.

The author of that quote is right. I did dig out some dirt on 5. Prime number 5 is secretly preparing to apply for a Nobel Prize in genetics. It is hiding its two twin brothers, 3 and 7, from the public eye, so that no one will notice that although 3 and 7 are twin brothers of 5, they are not twin brothers of each other. This situation is unique. While 5 has always been a member of two pairs of twin prime brothers, none of the tabloids has picked up on this.

And don’t even get me started on number 7! I haven’t put it on my website, but everyone knows that 7 is a cannibal, because seven eight nine.

After the link on CollegeHumor appeared, the number of visits jumped 20-fold. The dirt is as good as gold. Maybe I should rethink my approach and put more scandal into my website. Better yet, I should add sex to it. Actually, I already have sex on my website — as part of the word “sextuple”.

No, I won’t cheapen my numbers just for publicity. I will not add numerical sex positions 69, 71, and 88 to my website. If you’re interested in those, check out the cartoon above, which is the work of the famous geek Randall Munroe in his xkcd comic. But he’s such a true geek that he doesn’t really know what 71 is and probably never heard of 88. (Feel free to call me, Randall.)

My website is about math. I admit that I have sprinkled a few entries on my site that might be considered non-mathematical, but those are my guilty pleasures. Numerical sex positions, however, are not one of them.

Here is a baby puzzle. On Monday the baby said A, on Tuesday AU, on Wednesday AUUA, on Thursday AUUAUAAU. What will she say on Saturday?

You can see that this very gifted baby increases her talking capacity twice each day. The first half of what she says repeats her speech of the day before; and the second half is like the first half, but switches every A and U. If the baby continues indefinitely, her text converges to an infinite sequence that mathematicians call the Thue-Morse sequence (A010060). Of course, mathematicians use zeroes and ones instead of A and U, so the sequence looks like 0110100110010110100….

This sequence has many interesting properties. For example, if you replace every zero by 01 and every one by 10 in the Thue-Morse sequence, you will get the Thue-Morse sequence back. You can see that this is so if you code A in the baby’s speech by 01 and U by 10. Thus the Thue-Morse sequence is a fixed point under this substitution. Moreover, the only two fixed points under this substitution are the Thue-Morse sequence and its negation (A010059).

The Thue-Morse sequence possesses many other cool properties. For example, the sequence doesn’t contain substrings 000 and 111. Actually any sequence built from the doubles 01 and 10 can’t contain the triples 000 and 111 because we switch the digit after every odd-indexed term of such a sequence. A more general and less trivial statement is also true for the Thue-Morse sequence: it doesn’t contain any cubes. That is, it doesn’t contain XXX, where X is any binary string.

I stumbled upon this sequence when I was playing with evil and odious numbers invented by John H. Conway. A number is evil if the number of ones in its binary expansion is even, and odious if it’s odd. We can define a function, called the odiousness of a number, in the following way: odiousness(n) is one, if n is odious and 0 otherwise. We can apply the odiousness function to a sequence of non-negative integers term-wise. Now I can describe the Thue-Morse sequence as the odiousness of the sequence of non-negative numbers. Indeed, the odiousness of the number 2ⁿ + k is opposite of the odiousness of k, if k is less than 2ⁿ. That means if we already know the odiousness of the numbers below 2ⁿ, the next 2ⁿ terms of the odiousness sequence is the bitwise negation of the first 2ⁿ terms. So odiousness is built the same way as the Thue-Morse sequence, and you can easily check that the initial terms are the same too.

Let me consider as an example the sequence which is the odiousness of triangular numbers A153638: 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0…. What can we say about this sequence? We can say that the number of zeroes is infinite, as all the terms with indices of the form 2^n-1(2ⁿ+1) are zeroes. Also, the number of ones is infinite because all the terms with indices of the form 2^2n-1(2^2n-1-1) are ones.

Obviously, we can define the evilness of a number or of a sequence with non-negative terms. Namely, the evilness of a number is 1 if the number is evil, and 0 if it is not. The evilness is the bitwise negation of the odiousness. The evilness of the sequence of non-negative integers is the negation of the Thue-Morse sequence. The odiousness sequence of any sequence of zeroes and ones is the sequence itself, and the evilness sequence is its negation.

I would like to define an inverse odiousness operation on binary sequences. Many different sequences can have the same odiousness sequence. In such a case mathematicians usually define the inverse operation as a minimal non-negative sequence whose odiousness is the given sequence. Obviously, the minimal inverse of a binary sequence is the sequence itself, and thus not very interesting. I suggest that we define the inverse as a minimal increasing sequence. In this case the odiousness inverse of the Thue-Morse sequence is the sequence of non-negative numbers.

For example, let me describe the inverse odiousness of the sequence of all ones. Naturally, all the numbers in the sequence must be odious, and by minimality property this is the sequence of odious numbers A000069: 1, 2, 4, 7, 8, 11, 13, 14, 16, 19…. Analogously, the odiousness inverse of the sequence of all zeroes is the sequence of evil numbers A001969: 0, 3, 5, 6, 9, 10, 12, 15, 17, 18, 20….

Let us find the odiousness inverse of the alternating sequence A000035: 0, 1, 0, 1, 0, 1…. This is the lexicographically smallest sequence of numbers changing putridity. By the way, “putridity” is the term suggested by John Conway to encompass odiousness and evilness the same way as parity encompasses oddness and evenness.

The odiousness inverse of the alternating sequence is the sequence A003159: 0, 1, 3, 4, 5, 7, 9, 11, 12, 13…. By my definition we can describe this sequence as indices of terms of the Thue-Morse sequence that are different from the previous term. This sequence can be described in many other ways. For example, the official definition in the OEIS is that this sequence consists of numbers whose binary expansion ends with an even number of zeroes. It is fun to prove that this is the case. It is also fun to show that this sequence can be built by adding numbers to it that are not doubles of previous terms.

Let us look at the first differences of the previous sequence. This is the sequence A026465: 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2… — the length of n-th run of identical symbols in the Thue-Morse sequence. As we know that the Thue-Morse sequence doesn’t contain three ones or three zeroes in a row, we can state that the terms of this sequence will continue to be ones or twos.

You can define putridity sequences for any non-negative sequence. Which of them are interesting? I do not know, but I know which of them are not very interesting. For example, the putridity of pronic (oblong) numbers sequence is the same as the putridity of the triangular numbers sequence. This is because pronic numbers are twice triangular numbers and putridity is independent of factors of two. Another uninformative putridity sequence is the odiousness of the powers of two. This sequence consists only of ones.

I bet that my readers can find putridity sequences that are interesting.