|
| |
|
|
A173822
|
|
a(n) shows the digitsum of the smallest a(n+1) not yet present in the sequence
|
|
3
| |
|
|
1, 10, 19, 9, 18, 8, 17, 7, 16, 6, 15, 5, 14, 4, 13, 3, 12, 2, 11, 29, 20, 101, 28, 26, 24, 22, 110, 37, 21, 100, 46, 31, 30, 102, 55, 23, 111, 38, 35, 32, 120, 39, 27, 25, 41, 40, 103, 64, 33, 201, 200, 299, 36, 42, 112, 47, 34, 121, 48, 44, 130, 49, 45, 50, 104, 73, 43, 202
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(1) = 1, and for n > 1 a(n) is the smallest integer not yet present in the sequence with digital sum a substring of the decimal digits of a(n-1).
|
|
|
LINKS
| Charles R Greathouse IV, Table of n, a(n) for n=1..10000
Eric Angelini, Visible DigitSums (sequence T)
|
|
|
EXAMPLE
| a(1) is 1, so a(2) must have digital sum 1, so a(2) = 10 (1 is already in the sequence). a(3) must then have digital sum 1, 0, or 10, so a(3) = 19. a(4) must have digital sum 1, 9, or 19 and so a(4) = 9.
|
|
|
CROSSREFS
| A173821, A173823
Sequence in context: A177172 A171767 A153689 * A122607 A113703 A103757
Adjacent sequences: A173819 A173820 A173821 * A173823 A173824 A173825
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Charles R Greathouse IV (charles.greathouse(AT)case.edu) and Eric Angelini, Mar 01 2010
|
| |
|
|
