Brachylog, 14(削除) 14 (削除ここまで) 11 bytes
;İ;0{N≜↔;?≠<≜.↔¬}f(tti(
-3 bytes tanks to Fatalize
Explanation
; { }f(i( -- Find the firstnth nnumber
İ0 -- numbers(starting whichwith 0)
N< -- which is positivebigger then the previous one
≜ -- make explicit (otherwise it will only try one number of eachfucks lengthup)
↔. -- which ifis reversedthe output
;?≠↔ -- is equaland toif itselfreversed
¬ tt -- return last one is not the output
Brachylog, 14 bytes
;İ{N≜↔;?≠}f(tt
Explanation
; { }f( -- Find the first n
İ -- numbers which
N -- is positive
≜ -- make explicit (otherwise it will only try one number of each length)
↔ -- which if reversed
;?≠ -- is equal to itself
tt -- return last one
Brachylog, (削除) 14 (削除ここまで) 11 bytes
;0{<≜.↔¬}i(
-3 bytes tanks to Fatalize
Explanation
; { }i( -- Find the nth number
0 -- (starting with 0)
< -- which is bigger then the previous one
≜ -- make explicit (otherwise it fucks up)
. -- which is the output
↔ -- and if reversed
¬ -- is not the output
Brachylog, 14 bytes
;İ{N≜↔;?≠}f(tt
Explanation
; { }f( -- Find the first n
İ -- numbers which
N -- is positive
≜ -- make explicit (otherwise it will only try one number of each length)
↔ -- which if reversed
;?≠ -- is equal to itself
tt -- return last one