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.

A117230 Start with 1 and repeatedly reverse the digits and add 1 to get the next term.

This page as a plain text file.
%I A117230 #28 Dec 14 2023 05:32:39
%S A117230 1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,
%T A117230 7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,
%U A117230 3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10
%N A117230 Start with 1 and repeatedly reverse the digits and add 1 to get the next term.
%H A117230 N. J. A. Sloane and others, <a href="/wiki/Sequences_of_RADD_type">Sequences of RADD type</a>, OEIS wiki.
%H A117230 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A117230 Has period 9.
%F A117230 G.f.: -x*(9*x^9 +9*x^8 +8*x^7 +7*x^6 +6*x^5 +5*x^4 +4*x^3 +3*x^2 +2*x +1) / ((x -1)*(x^2 +x +1)*(x^6 +x^3 +1)). - _Colin Barker_, May 23 2014
%p A117230 read transforms; t1:=[1]; for n from 1 to 80 do t1:=[op(t1),1+digrev(t1[n])]; od:
%t A117230 Join[{1},LinearRecurrence[{0,0,0,0,0,0,0,0,1},{2,3,4,5,6,7,8,9,10},99]] (* _Ray Chandler_, Jul 18 2015 *)
%o A117230 (PARI) a(n)=if(n>1,(n-2)%9+2,1) \\ _M. F. Hasler_, May 22 2014
%Y A117230 Cf. A117830, A117521, A117828, A117800, A117816, A117817.
%K A117230 nonn,base,easy
%O A117230 1,2
%A A117230 _N. J. A. Sloane_, following discussions with Luc Stevens, May 04 2006
%E A117230 Correction to the terms of the sequence (inserted missing term) _Jeremy Gardiner_, Jun 17 2010