login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167831 Largest m<=n such that no carry occurs when adding m to n in decimal arithmetic. 6
0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 10, 11, 12, 13, 14, 14, 13, 12, 11, 10, 20, 21, 22, 23, 24, 24, 23, 22, 21, 20, 30, 31, 32, 33, 34, 34, 33, 32, 31, 30, 40, 41, 42, 43, 44, 44, 43, 42, 41, 40, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

A167832(n) = a(n) + n.

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..9999

PROG

(Haskell)

a167831 n = head [x | let ds = a031298_row n, x <- [n, n-1 ..],

                      all (< 10) $ zipWith (+) ds (a031298_row x)]

-- Reinhard Zumkeller, Mar 15 2014

CROSSREFS

Cf. A167877, A035327 for the ternary and binary cases.

Cf. A031298.

Sequence in context: A133852 A093150 A301297 * A090281 A051951 A262857

Adjacent sequences:  A167828 A167829 A167830 * A167832 A167833 A167834

KEYWORD

base,nonn,look

AUTHOR

Reinhard Zumkeller, Nov 14 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 15:41 EST 2018. Contains 317323 sequences. (Running on oeis4.)