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.

A065214 Numbers which need nine 'Reverse and Add' steps to reach a palindrome.

This page as a plain text file.
%I A065214 #15 Dec 08 2024 14:15:20
%S A065214 1397,1487,1577,1667,1757,1847,1937,2396,2486,2576,2666,2756,2846,
%T A065214 2936,2999,3395,3485,3575,3665,3755,3845,3935,3998,4394,4484,4574,
%U A065214 4754,4844,4934,4997,5393,5483,5573,5663,5753,5843,5933,5996,6392,6482,6572
%N A065214 Numbers which need nine 'Reverse and Add' steps to reach a palindrome.
%C A065214 The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
%C A065214 Numbers k such that A033665(k) = 9. - _Andrew Howroyd_, Dec 08 2024
%H A065214 Vincenzo Librandi, <a href="/A065214/b065214.txt">Table of n, a(n) for n = 1..1000</a>
%H A065214 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t A065214 lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #!= FromDigits[Reverse[IntegerDigits[#]]]&, 1, 10]] == 10; Select[Range[1000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *)
%Y A065214 Cf. A002113, A033665, A065206. Different from A015990.
%K A065214 nonn,base
%O A065214 1,1
%A A065214 _Klaus Brockhaus_, Oct 21 2001