Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045844
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045844 a(n+1) = a(n) + largest digit of a(n); a(0) = 1. +0
3
1, 2, 4, 8, 16, 22, 24, 28, 36, 42, 46, 52, 57, 64, 70, 77, 84, 92, 101, 102, 104, 108, 116, 122, 124, 128, 136, 142, 146, 152, 157, 164, 170, 177, 184, 192, 201, 203, 206, 212, 214, 218, 226, 232, 235, 240, 244, 248, 256, 262, 268, 276, 283, 291, 300, 303, 306 (list; graph; listen)
OFFSET

0,2

FORMULA

a(0) = 1; a(n) = a(n-1) + MaxDigit(a(n-1)) for n > 0 where MaxDigit(x) is the largest digit in decimal notation for an integer x.

EXAMPLE

a(17) = 92; a(18) = 92 + 9 = 101; a(19) = 101 + 1 = 102; a(20) = 102 + 2 = 104

CROSSREFS

Cf. A061681.

Sequence in context: A001856 A002081 A102039 this_sequence A063108 A058961 A130917

Adjacent sequences: A045841 A045842 A045843 this_sequence A045845 A045846 A045847

KEYWORD

base,easy,nonn,nice

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research