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-1 of 1 results.

A193306 Number of 'Reverse and Subtract' steps needed to reach 0, or -1 if never reaches 0, using base -1+i and subtracting the reversed number from original.

Original entry on oeis.org

0, 1, 2, 1, 4, 1, 4, 1, 4, 1, 4, 3, -1, -1, 4, 1, -1, 1, 4, -1, -1, 1, 4, -1, 2, 11, -1, 1, 2, 11, -1, 1, -1, 1, 12, 11, -1, 3, 2, -1, 6, -1, -1, -1, -1, 1, 12, 11, 4, -1, -1, 1, 8, 5, -1, 3, -1, 3, 6, -1, 4, -1, -1, 1, 2, 1, 2, -1, -1, -1, -1, 3, 2, 1, 2
Offset: 0

Views

Author

Kerry Mitchell, Jul 22 2011

Keywords

Examples

			Decimal 2 is 10 in binary, which is -1+i using complex base -1+i. Reversing 10 gives 01, or 1+0i.  Subtracting the reversed from the original results in -2+i, or 11111 using the complex base.  Its reversal is the same, so subtracting them gives 0.  Decimal 2 took 2 steps to reach 0, so a(2) = 2.
		

Crossrefs

Cf A193239, number of steps needed to reach a palindrome with complex base -1+i. A193307, Number of 'Reverse and Subtract' steps needed to reach 0, or -1 if never reaches 0, using base -1+i and subtracting the original number from the reversed.
Showing 1-1 of 1 results.