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.
%I A306599 #25 Jun 08 2019 10:27:20 %S A306599 0,8,15,39,47,109,375,1591,4470,4596,6393,6718,7930,16439,28903,34292, %T A306599 49465,264496,265750,266126,311290,2067455,16808764,18276328, %U A306599 1074296036,1075478361 %N A306599 In base 8: a(n) sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with a(n). %C A306599 It is conjectured that if a Reverse and Add! trajectory reaches a palindrome, it will be reached in relatively few steps, or otherwise it will never reach a palindrome. - _A.H.M. Smeets_, May 30 2019 %Y A306599 Records in A306600. %Y A306599 Base 10: A065198 and A065199. %K A306599 nonn,base,more %O A306599 0,2 %A A306599 _A.H.M. Smeets_, Feb 27 2019 %E A306599 a(21)-a(25) from _A.H.M. Smeets_, May 30 2019