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!)
A061882 a(n) = Smallest nontrivial number k > 9 such that first (leftmost) digit - second digit + third digit - fourth digit ... of k = n. 27
11, 10, 20, 30, 40, 50, 60, 70, 80, 90, 109, 209, 309, 409, 509, 609, 709, 809, 909, 10909, 20909, 30909, 40909, 50909, 60909, 70909, 80909, 90909, 1090909, 2090909, 3090909, 4090909, 5090909, 6090909, 7090909, 8090909, 9090909, 109090909 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Starting with 109, this sequence has the same terms as A060982 and A061479. - Georg Fischer, May 24 2022
LINKS
PROG
(PARI) a(n) = my(k=1, d=digits(k)); while (sum(k=1, #d, (-1)^(k+1)*d[k]) != n, k++; d=digits(k)); k; \\ Michel Marcus, May 24 2022
CROSSREFS
Sequence in context: A323294 A082122 A360450 * A323296 A275782 A120005
KEYWORD
base,nonn,easy
AUTHOR
Larry Reeves (larryr(AT)acm.org), May 15 2001
EXTENSIONS
Definition amended by Georg Fischer, May 24 2022
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 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)