Search: id:A016016
Results 1-1 of 1 results found.
%I A016016
%S A016016 1,1,1,1,2,2,2,2,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,
%T A016016 1,1,1,2,1,2,1,1,1,1,1,1,2,1,2,2,1,1,1,1,1,2,1,2,2,3,1,1,1,1,2,1,2,
%U A016016 2,3,4,1,1,1,2,1,2,2,3,4,6,1,1,2,1,2,2,3,4,6,24,1,2,1,2,2,3,4,6,24
%N A016016 Number of iterations of Reverse and Add which lead to a palindrome, or
-1 if no palindrome is ever reached.
%C A016016 Palindromes themselves are also 'Reverse and Add!'ed !
%C A016016 It is conjectured that a(196) = -1 - see A006860, A023108.
%H A016016 T. D. Noe, Table of n, a(n) for n=1..195
%H A016016 Index entries for sequences related to Reverse
and Add!
%H A016016 J. Walker,
Three Years Of Computing: Final Report On The Palindrome Quest
%e A016016 6 -> 6 + 6 = 12 -> 12 + 21 = 33 is palindromic, took 2 steps so a(6)=2.
%Y A016016 Cf. A033665, A023109, A006960.
%Y A016016 Sequence in context: A037806 A038082 A107740 this_sequence A063059 A102675
A143544
%Y A016016 Adjacent sequences: A016013 A016014 A016015 this_sequence A016017 A016018
A016019
%K A016016 nonn,base,nice
%O A016016 1,5
%A A016016 Robert G. Wilson v (rgwv(AT)rgwv.com)
Search completed in 0.001 seconds