login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061521 a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 6. 0

%I #9 May 21 2015 10:18:33

%S 1,7,13,79,1315,79711,13151377,79711791313,1315137713157979,

%T 797117913137971113151315,1315137713157979131513777971179711,

%U 797117913137971113151315797117913131315137713151377,131513771315797913151377797117971113151377131579797971179131379711791313

%N a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 6.

%C 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.

%t NestList[FromDigits[Flatten[IntegerDigits/@(IntegerDigits[#]+6)]]&,1,15] (* _Harvey P. Dale_, May 21 2015 *)

%K base,nonn

%O 0,2

%A _Amarnath Murthy_, May 08 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), May 11 2001

%E a(5)-a(12) corrected by _Harvey P. Dale_, May 21 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)