login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194233 Smallest number greater than n with exactly the same digits as n in decimal representation, a(n)=10*n if no such number exists. 2
10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 21, 31, 41, 51, 61, 71, 81, 91, 200, 210, 220, 32, 42, 52, 62, 72, 82, 92, 300, 310, 320, 330, 43, 53, 63, 73, 83, 93, 400, 410, 420, 430, 440, 54, 64, 74, 84, 94, 500, 510, 520, 530, 540, 550, 65, 75, 85, 95 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A004186(a(n)) = A004186(n) or A004186(a(n)) = 10*A004186(n).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

PROG

(Haskell)

import Data.List (find); import Data.Maybe (fromMaybe)

a194233 n =

fromMaybe (10*n) $ find (== a004186 n) $ map a004186 [n+1..10*n]

CROSSREFS

Sequence in context: A201014 A096092 A109597 * A263172 A008592 A158814

Adjacent sequences: A194230 A194231 A194232 * A194234 A194235 A194236

KEYWORD

nonn,base,look

AUTHOR

Reinhard Zumkeller, Aug 19 2011

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 December 9 16:05 EST 2022. Contains 358701 sequences. (Running on oeis4.)