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!)
A179988 Smallest m such that n = sum of digits of A108971(m). 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 26, 29, 46, 49, 66, 69, 86, 89, 176, 273, 376, 473, 576, 673, 776, 873, 976, 1773, 2776, 3773, 4776, 5773, 6776, 7773, 8776, 9773, 17776, 27773, 37776 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A179987(a(n)) = n and A179987(m) <> n for m < a(n);
A108971(a(n)) = A051885(n+1);
A007953(A108971(a(n))) = n;
conjecture for n>=18: a(n) = A051885(n+1) + 7*(10^floor(n/9) - 1)/9 - 3*(n mod 2).
LINKS
CROSSREFS
Sequence in context: A128606 A085123 A131571 * A364187 A179979 A256005
KEYWORD
base,nonn
AUTHOR
Reinhard Zumkeller, Aug 09 2010
STATUS
approved

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)