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.

A061522 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 7.

This page as a plain text file.
%I A061522 #9 Jun 05 2023 14:03:26
%S A061522 0,7,14,811,1588,8121515,1589812812,812151615891589,
%T A061522 158981281381215168121516,812151615891581015898128131589812813,
%U A061522 15898128138121516812158781215161589158108121516158915810
%N A061522 a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 7.
%C A061522 In A061511-A061522, A061746-A061750 when the incremented digit exceeds 9 it is written as a 2-digit string. So 9+1 becomes the 2-digit string 10, etc.
%H A061522 Indranil Ghosh, <a href="/A061522/b061522.txt">Table of n, a(n) for n = 0..16</a>
%e A061522 In the sequence 1588 follows 811 because 8+7 = 15 and 1+7 = 8. - _Indranil Ghosh_, Feb 09 2017
%t A061522 NestList[FromDigits[Flatten[IntegerDigits/@(IntegerDigits[#]+7)]]&,0,10] (* _Harvey P. Dale_, Jun 05 2023 *)
%K A061522 base,nonn
%O A061522 0,2
%A A061522 _Amarnath Murthy_, May 08 2001
%E A061522 More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001