Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061516
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061516 a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 4. +0
1
1, 5, 9, 13, 57, 911, 1355, 5799, 9111313, 13555757, 5799911911, 911131313551355, 1355575757995799, 579991191191113139111313, 9111313135513551355575713555757, 135557575799579957999119115799911911 (list; graph; listen)
OFFSET

0,2

COMMENT

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.

MATHEMATICA

a[1]=1; a[n_]:=a[n]=FromDigits[Flatten[IntegerDigits/@(IntegerDigits[a[n-1]]+4)]]; Table[a[n], {n, 15}] - Zak Seidov (zakseidov(AT)yahoo.com), Mar 09 2006

CROSSREFS

Sequence in context: A118837 A117828 A117830 this_sequence A146135 A101116 A030772

Adjacent sequences: A061513 A061514 A061515 this_sequence A061517 A061518 A061519

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 08 2001

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research