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.

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

This page as a plain text file.
%I A118526 #10 Nov 07 2019 22:25:43
%S A118526 1,8,15,58,92,36,70,14,48,91,26,69,103,308,810,25,59,102,208,809,915,
%T A118526 526,632,243,349,950,66,73,44,51,22,29,99,106,608,813,325,530,42,31,
%U A118526 20,9,16,68,93,46,71,24,49,101,108,808,815,525,532,242,249,949,956,666,673,383,390,100,8
%N A118526 Start with 1 and repeatedly reverse the digits and add 7 to get the next term.
%H A118526 N. J. A. Sloane and others, <a href="/wiki/Sequences_of_RADD_type">Sequences of RADD type</a>, OEIS wiki.
%H A118526 <a href="/index/Rec#order_63">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A118526 After 1 step enters a cycle of length 63.
%p A118526 a:= proc(n) option remember; `if`(n=1, 1, 7 +(s-> parse(
%p A118526       cat(seq(s[-i], i=1..length(s)))))(cat("", a(n-1))))
%p A118526     end:
%p A118526 seq(a(n), n=1..65);  # _Alois P. Heinz_, Nov 07 2019
%Y A118526 Cf. A117828, A117816, A117817.
%K A118526 nonn,base
%O A118526 1,2
%A A118526 _N. J. A. Sloane_, May 06 2006