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.

A091680 Smallest number whose base-4 Reverse and Add! trajectory (presumably) contains exactly n base-4 palindromes, or -1 if there is no such number.

Original entry on oeis.org

290, 78, 18, 6, 3, 36, 21, 19, 7, 8, 4, 2, 1, -1, -1, -1, -1, -1, -1, -1, -1
Offset: 0

Views

Author

Klaus Brockhaus, Jan 28 2004

Keywords

Comments

Conjecture 1: For each k > 0 the trajectory of k eventually leads to a term in the trajectory of some j which belongs to A075421, i.e., whose trajectory (presumably) never leads to a palindrome. Conjecture 2: There is no k > 0 such that the trajectory of k contains more than twelve palindromes, i.e., a(n) = -1 for n > 12.
Base-4 analog of A077594.

Examples

			a(4) = 3 since the trajectory of 3 contains the four palindromes 3, 15, 975, 64575 (3, 33, 33033, 3330333 in base 4) and at 20966400 joins the trajectory of 318 = A075421(2) and the trajectories of 1 (A035524) and 2 do not contain exactly four palindromes.
		

Crossrefs