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.

A065210 Numbers which need five 'Reverse and Add' steps to reach a palindrome.

This page as a plain text file.
%I A065210 #19 Dec 06 2024 16:24:35
%S A065210 166,176,198,265,275,297,364,374,396,463,473,495,549,562,572,594,639,
%T A065210 648,661,671,693,738,760,770,792,837,846,891,936,945,990,1396,1486,
%U A065210 1576,1666,1697,1756,1787,1791,1793,1796,1846,1877,1883,1886,1890,1936
%N A065210 Numbers which need five 'Reverse and Add' steps to reach a palindrome.
%C A065210 The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
%C A065210 Numbers k such that A033665(k) = 5. - _Andrew Howroyd_, Dec 06 2024
%H A065210 Harvey P. Dale, <a href="/A065210/b065210.txt">Table of n, a(n) for n = 1..3000</a>
%H A065210 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t A065210 palQ[k_]:=IntegerDigits[k]==Reverse[IntegerDigits[k]]; fraQ[n_]:= Module[ {ras=NestList[#+FromDigits[Reverse[IntegerDigits[#]]]&,n,5]},palQ/@ ras=={False,False,False,False,False,True}]; Select[Range[2000],fraQ] (* _Harvey P. Dale_, Sep 28 2015 *)
%Y A065210 Cf. A002113, A015982, A033665, A065206.
%K A065210 nonn,base
%O A065210 1,1
%A A065210 _Klaus Brockhaus_, Oct 21 2001
%E A065210 Offset changed to 1 by _Harry J. Smith_, Oct 14 2009