Jumping Numbers












8












$begingroup$


A jumping number is defined as a positive number n which all pairs of consecutive decimal digits differ by 1. Also, all single digit numbers are considered jumping numbers. eg. 3, 45676, 212 are jumping numbers but 414 and 13 are not. The difference between 9 and 0 is not considered as 1



The challenge
Create a program that output one of the following results:




  • Given an input n output the first n jumping numbers.

  • Given an input n output the nth term of the sequence.


Note




  • Any valid I/O format is allowed

  • 1-index or 0-index is allowed (please specify)


Here are some jumping numbers:



1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 101, 121, 123, 210, 212, 232, 234, 321, 323, 343, 345, 432, 434, 454, 456, 543, 545, 565, 567, 654, 656, 676, 678, 765, 767, 787, 789, 876, ...


This is also A033075










share|improve this question











$endgroup$












  • $begingroup$
    Is this 0 or 1 Indexed?
    $endgroup$
    – Taylor Scott
    10 hours ago






  • 1




    $begingroup$
    @TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
    $endgroup$
    – Luis felipe De jesus Munoz
    10 hours ago










  • $begingroup$
    I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
    $endgroup$
    – Jonathan Allan
    9 hours ago












  • $begingroup$
    Yes @JonathanAllan
    $endgroup$
    – Luis felipe De jesus Munoz
    9 hours ago
















8












$begingroup$


A jumping number is defined as a positive number n which all pairs of consecutive decimal digits differ by 1. Also, all single digit numbers are considered jumping numbers. eg. 3, 45676, 212 are jumping numbers but 414 and 13 are not. The difference between 9 and 0 is not considered as 1



The challenge
Create a program that output one of the following results:




  • Given an input n output the first n jumping numbers.

  • Given an input n output the nth term of the sequence.


Note




  • Any valid I/O format is allowed

  • 1-index or 0-index is allowed (please specify)


Here are some jumping numbers:



1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 101, 121, 123, 210, 212, 232, 234, 321, 323, 343, 345, 432, 434, 454, 456, 543, 545, 565, 567, 654, 656, 676, 678, 765, 767, 787, 789, 876, ...


This is also A033075










share|improve this question











$endgroup$












  • $begingroup$
    Is this 0 or 1 Indexed?
    $endgroup$
    – Taylor Scott
    10 hours ago






  • 1




    $begingroup$
    @TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
    $endgroup$
    – Luis felipe De jesus Munoz
    10 hours ago










  • $begingroup$
    I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
    $endgroup$
    – Jonathan Allan
    9 hours ago












  • $begingroup$
    Yes @JonathanAllan
    $endgroup$
    – Luis felipe De jesus Munoz
    9 hours ago














8












8








8





$begingroup$


A jumping number is defined as a positive number n which all pairs of consecutive decimal digits differ by 1. Also, all single digit numbers are considered jumping numbers. eg. 3, 45676, 212 are jumping numbers but 414 and 13 are not. The difference between 9 and 0 is not considered as 1



The challenge
Create a program that output one of the following results:




  • Given an input n output the first n jumping numbers.

  • Given an input n output the nth term of the sequence.


Note




  • Any valid I/O format is allowed

  • 1-index or 0-index is allowed (please specify)


Here are some jumping numbers:



1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 101, 121, 123, 210, 212, 232, 234, 321, 323, 343, 345, 432, 434, 454, 456, 543, 545, 565, 567, 654, 656, 676, 678, 765, 767, 787, 789, 876, ...


This is also A033075










share|improve this question











$endgroup$




A jumping number is defined as a positive number n which all pairs of consecutive decimal digits differ by 1. Also, all single digit numbers are considered jumping numbers. eg. 3, 45676, 212 are jumping numbers but 414 and 13 are not. The difference between 9 and 0 is not considered as 1



The challenge
Create a program that output one of the following results:




  • Given an input n output the first n jumping numbers.

  • Given an input n output the nth term of the sequence.


Note




  • Any valid I/O format is allowed

  • 1-index or 0-index is allowed (please specify)


Here are some jumping numbers:



1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 101, 121, 123, 210, 212, 232, 234, 321, 323, 343, 345, 432, 434, 454, 456, 543, 545, 565, 567, 654, 656, 676, 678, 765, 767, 787, 789, 876, ...


This is also A033075







code-golf number sequence






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 3 hours ago









DLosc

19.3k33889




19.3k33889










asked 10 hours ago









Luis felipe De jesus MunozLuis felipe De jesus Munoz

5,35721669




5,35721669












  • $begingroup$
    Is this 0 or 1 Indexed?
    $endgroup$
    – Taylor Scott
    10 hours ago






  • 1




    $begingroup$
    @TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
    $endgroup$
    – Luis felipe De jesus Munoz
    10 hours ago










  • $begingroup$
    I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
    $endgroup$
    – Jonathan Allan
    9 hours ago












  • $begingroup$
    Yes @JonathanAllan
    $endgroup$
    – Luis felipe De jesus Munoz
    9 hours ago


















  • $begingroup$
    Is this 0 or 1 Indexed?
    $endgroup$
    – Taylor Scott
    10 hours ago






  • 1




    $begingroup$
    @TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
    $endgroup$
    – Luis felipe De jesus Munoz
    10 hours ago










  • $begingroup$
    I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
    $endgroup$
    – Jonathan Allan
    9 hours ago












  • $begingroup$
    Yes @JonathanAllan
    $endgroup$
    – Luis felipe De jesus Munoz
    9 hours ago
















$begingroup$
Is this 0 or 1 Indexed?
$endgroup$
– Taylor Scott
10 hours ago




$begingroup$
Is this 0 or 1 Indexed?
$endgroup$
– Taylor Scott
10 hours ago




1




1




$begingroup$
@TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
$endgroup$
– Luis felipe De jesus Munoz
10 hours ago




$begingroup$
@TaylorScott The sequence consists in only positive numbers. If you mean the input n then it is up to you.
$endgroup$
– Luis felipe De jesus Munoz
10 hours ago












$begingroup$
I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
$endgroup$
– Jonathan Allan
9 hours ago






$begingroup$
I'm guessing "Any valid I/O format is allowed" includes outputting the numbers as lists of decimal digits, but just wanted to confirm - ?
$endgroup$
– Jonathan Allan
9 hours ago














$begingroup$
Yes @JonathanAllan
$endgroup$
– Luis felipe De jesus Munoz
9 hours ago




$begingroup$
Yes @JonathanAllan
$endgroup$
– Luis felipe De jesus Munoz
9 hours ago










15 Answers
15






active

oldest

votes


















3












$begingroup$


Jelly, 8 bytes



1DI*`ƑƊ#


A full program accepting an integer, n, from STDIN which prints a list of the first n positive jumping numbers.



Try it online!



How?



Acceptable incremental differences between digits are 1 and -1 while others from [-9,-2]+[2,9] are not. This lines up with integers which are invariant when raised to themselves. i.e. $x^x=x$ since:



$$0^0=1$$
$$1^1=1$$
$$2^2=4$$
$$cdots$$
$$-1^{-1}=-1$$
$$-2^{-2}=-frac{1}{4}$$
$$cdots$$



1DI*`ƑƊ# - Main Link: no arguments (accepts a line of input from STDIN)
# - count up keeping the first (input) n matches...
1 - ...start with n equal to: 1
Ɗ - ...match function: last three links as a monad: e.g. 245 777 7656
D - convert to a list of decimal digits [2,4,5] [7,7,7] [7,6,5,6]
I - incremental differences [2,1] [0,0] [-1,-1,1]
Ƒ - invariant under?:
` - using left argument as both inputs of:
* - exponentiation (vectorises) [4,1] [1,1] [-1,-1,1]
- --so we: discard discard keep
- implicitly print the list of collected values of n





share|improve this answer











$endgroup$





















    3












    $begingroup$


    05AB1E (legacy), 5 bytes



    The input is 1-indexed.



    Code:



    µN¥ÄP


    Uses the 05AB1E encoding. Try it online!






    Explanation



    µ          # Get the nth number, starting from 0, such that...
    Ä # The absolute values
    N¥ # Of the delta's of N
    P # Are all 1 (product function, basically acts as a reduce by AND)





    share|improve this answer











    $endgroup$













    • $begingroup$
      Right tool for the job.
      $endgroup$
      – lirtosiast
      1 hour ago



















    2












    $begingroup$


    C (gcc), 90 bytes





    f(n,K,b,k){for(K=0;n;b&&printf("%d,",K,n--))for(b=k=++K;k/10;)b*=abs(k%10-(k/=10)%10)==1;}


    Try it online!






    share|improve this answer









    $endgroup$





















      2












      $begingroup$

      Japt, 14 bytes



      Outputs the first nth term, 1-indexed.



      _ì äa dÉ ªU´}f


      Try it



      (I know, I know, I'm supposed to be taking a break but I'm in golf withdrawal!)






      share|improve this answer











      $endgroup$













      • $begingroup$
        Haha, maybe go learn a new golfing language to cure your withdrawal. :P
        $endgroup$
        – Quintec
        7 hours ago



















      2












      $begingroup$


      Python 2, 88 87 bytes





      f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
      g=lambda i:i<10or abs(i/10%10-i%10)==1==g(i/10)


      Try it online!



      Returns the 0-indexed jumping number (i.e., f(0) => 1, etc).






      share|improve this answer











      $endgroup$













      • $begingroup$
        Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
        $endgroup$
        – lirtosiast
        1 hour ago












      • $begingroup$
        @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
        $endgroup$
        – Chas Brown
        39 mins ago



















      1












      $begingroup$

      JavaScript (ES7), 60 bytes



      Returns the $n$th term of the sequence (1-indexed).





      f=(n,k)=>[...k+''].some(p=x=>(p-(p=x))**2-1)||n--?f(n,-~k):k


      Try it online!






      share|improve this answer









      $endgroup$





















        1












        $begingroup$


        Jelly, 9 bytes



        -1 by Jonathan Allan



        1DạƝ=1ẠƲ#


        Try it online!



        1-indexed.






        share|improve this answer











        $endgroup$













        • $begingroup$
          9 bytes by reading STDIN
          $endgroup$
          – Jonathan Allan
          9 hours ago





















        1












        $begingroup$


        Haskell, 79 bytes




        • Thanks to Joseph Sible for enforcing the challenge rules.


        f=(filter g[1..]!!)
        g m|d<-read.pure<$>show m=all((==1).abs).zipWith(-)d$tail d


        Try it online!






        share|improve this answer











        $endgroup$









        • 1




          $begingroup$
          This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
          $endgroup$
          – Joseph Sible
          8 hours ago










        • $begingroup$
          @JosephSible You are correct. Thank you for noting.
          $endgroup$
          – Jonathan Frech
          4 hours ago



















        1












        $begingroup$


        Haskell, 57 bytes





        (l!!)
        l=[1..9]++[x*10+t|x<-l,t<-[0..9],(mod x 10-t)^2==1]


        Try it online!






        share|improve this answer











        $endgroup$





















          0












          $begingroup$

          Swift, 228 bytes



          func j(n:Int){
          var r:[Int]=
          for x in 0...n{
          if x<=10{r.append(x)}else{
          let t=String(x).compactMap{Int(String($0))}
          var b=true
          for i in 1...t.count-1{if abs(t[i-1]-t[i]) != 1{b=false}}
          if b{r.append(x)}
          }
          }
          print(r)
          }
          j(n:1000)


          Try it online!






          share|improve this answer











          $endgroup$





















            0












            $begingroup$


            Python 3, 122 121 bytes





            g=lambda s:len(s)==1or 1==abs(ord(s[0])-ord(s[1]))and g(s[1:])
            def f(n,i=1):
            while n:
            if g(str(i)):n-=1;yield i
            i+=1


            Try it online!



            -1 byte by changing f from printing, to a generator function.



            g is a recursive helper function which determines if a string s is a "jumping string" (this works since the character codes for 0 to 9 are in order and contiguous).



            f is a generator function that takes in n and yields the first n jumping numbers.






            share|improve this answer









            $endgroup$





















              0












              $begingroup$


              R, 85 bytes





              i=scan();j=0;while(i)if((j=j+1)<10|all(abs(diff(j%/%10^(0:log10(j))%%10))==1))i=i-1;j


              Try it online!



              Suspect this can be golfed more. Reads the number using scan() and outputs the appropriate jumping number.






              share|improve this answer









              $endgroup$





















                0












                $begingroup$


                Perl 5, 56 bytes





                map{1while++$n=~s|.(?=(.))|abs$&-$1!=1|ger>9}1..<>;say$n


                Try it online!



                1-indexed, outputs the nth jumping number






                share|improve this answer









                $endgroup$





















                  0












                  $begingroup$


                  Wolfram Language (Mathematica), 85 bytes



                  If[#<10,#,t=n=1;While[t<=#,{-1,1}~SubsetQ~Differences@IntegerDigits@n++~If~t++];n-1]&


                  Try it online!



                  returns the n-th number






                  share|improve this answer











                  $endgroup$





















                    0












                    $begingroup$


                    Python 2, 79 bytes





                    f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                    g=lambda i:i<10or i%100%11%9==g(i/10)>0


                    Try it online!



                    Derived from Chas Brown's answer. The helper function g(i) returns whether i is a jumping number. Iff the last two digits of a number n have absolute difference 1, then n%100%11 will be either 1 or 10, so n%100%11%9 will be 1.






                    share|improve this answer









                    $endgroup$













                      Your Answer





                      StackExchange.ifUsing("editor", function () {
                      return StackExchange.using("mathjaxEditing", function () {
                      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
                      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
                      });
                      });
                      }, "mathjax-editing");

                      StackExchange.ifUsing("editor", function () {
                      StackExchange.using("externalEditor", function () {
                      StackExchange.using("snippets", function () {
                      StackExchange.snippets.init();
                      });
                      });
                      }, "code-snippets");

                      StackExchange.ready(function() {
                      var channelOptions = {
                      tags: "".split(" "),
                      id: "200"
                      };
                      initTagRenderer("".split(" "), "".split(" "), channelOptions);

                      StackExchange.using("externalEditor", function() {
                      // Have to fire editor after snippets, if snippets enabled
                      if (StackExchange.settings.snippets.snippetsEnabled) {
                      StackExchange.using("snippets", function() {
                      createEditor();
                      });
                      }
                      else {
                      createEditor();
                      }
                      });

                      function createEditor() {
                      StackExchange.prepareEditor({
                      heartbeatType: 'answer',
                      autoActivateHeartbeat: false,
                      convertImagesToLinks: false,
                      noModals: true,
                      showLowRepImageUploadWarning: true,
                      reputationToPostImages: null,
                      bindNavPrevention: true,
                      postfix: "",
                      imageUploader: {
                      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
                      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
                      allowUrls: true
                      },
                      onDemand: true,
                      discardSelector: ".discard-answer"
                      ,immediatelyShowMarkdownHelp:true
                      });


                      }
                      });














                      draft saved

                      draft discarded


















                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180693%2fjumping-numbers%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown

























                      15 Answers
                      15






                      active

                      oldest

                      votes








                      15 Answers
                      15






                      active

                      oldest

                      votes









                      active

                      oldest

                      votes






                      active

                      oldest

                      votes









                      3












                      $begingroup$


                      Jelly, 8 bytes



                      1DI*`ƑƊ#


                      A full program accepting an integer, n, from STDIN which prints a list of the first n positive jumping numbers.



                      Try it online!



                      How?



                      Acceptable incremental differences between digits are 1 and -1 while others from [-9,-2]+[2,9] are not. This lines up with integers which are invariant when raised to themselves. i.e. $x^x=x$ since:



                      $$0^0=1$$
                      $$1^1=1$$
                      $$2^2=4$$
                      $$cdots$$
                      $$-1^{-1}=-1$$
                      $$-2^{-2}=-frac{1}{4}$$
                      $$cdots$$



                      1DI*`ƑƊ# - Main Link: no arguments (accepts a line of input from STDIN)
                      # - count up keeping the first (input) n matches...
                      1 - ...start with n equal to: 1
                      Ɗ - ...match function: last three links as a monad: e.g. 245 777 7656
                      D - convert to a list of decimal digits [2,4,5] [7,7,7] [7,6,5,6]
                      I - incremental differences [2,1] [0,0] [-1,-1,1]
                      Ƒ - invariant under?:
                      ` - using left argument as both inputs of:
                      * - exponentiation (vectorises) [4,1] [1,1] [-1,-1,1]
                      - --so we: discard discard keep
                      - implicitly print the list of collected values of n





                      share|improve this answer











                      $endgroup$


















                        3












                        $begingroup$


                        Jelly, 8 bytes



                        1DI*`ƑƊ#


                        A full program accepting an integer, n, from STDIN which prints a list of the first n positive jumping numbers.



                        Try it online!



                        How?



                        Acceptable incremental differences between digits are 1 and -1 while others from [-9,-2]+[2,9] are not. This lines up with integers which are invariant when raised to themselves. i.e. $x^x=x$ since:



                        $$0^0=1$$
                        $$1^1=1$$
                        $$2^2=4$$
                        $$cdots$$
                        $$-1^{-1}=-1$$
                        $$-2^{-2}=-frac{1}{4}$$
                        $$cdots$$



                        1DI*`ƑƊ# - Main Link: no arguments (accepts a line of input from STDIN)
                        # - count up keeping the first (input) n matches...
                        1 - ...start with n equal to: 1
                        Ɗ - ...match function: last three links as a monad: e.g. 245 777 7656
                        D - convert to a list of decimal digits [2,4,5] [7,7,7] [7,6,5,6]
                        I - incremental differences [2,1] [0,0] [-1,-1,1]
                        Ƒ - invariant under?:
                        ` - using left argument as both inputs of:
                        * - exponentiation (vectorises) [4,1] [1,1] [-1,-1,1]
                        - --so we: discard discard keep
                        - implicitly print the list of collected values of n





                        share|improve this answer











                        $endgroup$
















                          3












                          3








                          3





                          $begingroup$


                          Jelly, 8 bytes



                          1DI*`ƑƊ#


                          A full program accepting an integer, n, from STDIN which prints a list of the first n positive jumping numbers.



                          Try it online!



                          How?



                          Acceptable incremental differences between digits are 1 and -1 while others from [-9,-2]+[2,9] are not. This lines up with integers which are invariant when raised to themselves. i.e. $x^x=x$ since:



                          $$0^0=1$$
                          $$1^1=1$$
                          $$2^2=4$$
                          $$cdots$$
                          $$-1^{-1}=-1$$
                          $$-2^{-2}=-frac{1}{4}$$
                          $$cdots$$



                          1DI*`ƑƊ# - Main Link: no arguments (accepts a line of input from STDIN)
                          # - count up keeping the first (input) n matches...
                          1 - ...start with n equal to: 1
                          Ɗ - ...match function: last three links as a monad: e.g. 245 777 7656
                          D - convert to a list of decimal digits [2,4,5] [7,7,7] [7,6,5,6]
                          I - incremental differences [2,1] [0,0] [-1,-1,1]
                          Ƒ - invariant under?:
                          ` - using left argument as both inputs of:
                          * - exponentiation (vectorises) [4,1] [1,1] [-1,-1,1]
                          - --so we: discard discard keep
                          - implicitly print the list of collected values of n





                          share|improve this answer











                          $endgroup$




                          Jelly, 8 bytes



                          1DI*`ƑƊ#


                          A full program accepting an integer, n, from STDIN which prints a list of the first n positive jumping numbers.



                          Try it online!



                          How?



                          Acceptable incremental differences between digits are 1 and -1 while others from [-9,-2]+[2,9] are not. This lines up with integers which are invariant when raised to themselves. i.e. $x^x=x$ since:



                          $$0^0=1$$
                          $$1^1=1$$
                          $$2^2=4$$
                          $$cdots$$
                          $$-1^{-1}=-1$$
                          $$-2^{-2}=-frac{1}{4}$$
                          $$cdots$$



                          1DI*`ƑƊ# - Main Link: no arguments (accepts a line of input from STDIN)
                          # - count up keeping the first (input) n matches...
                          1 - ...start with n equal to: 1
                          Ɗ - ...match function: last three links as a monad: e.g. 245 777 7656
                          D - convert to a list of decimal digits [2,4,5] [7,7,7] [7,6,5,6]
                          I - incremental differences [2,1] [0,0] [-1,-1,1]
                          Ƒ - invariant under?:
                          ` - using left argument as both inputs of:
                          * - exponentiation (vectorises) [4,1] [1,1] [-1,-1,1]
                          - --so we: discard discard keep
                          - implicitly print the list of collected values of n






                          share|improve this answer














                          share|improve this answer



                          share|improve this answer








                          edited 8 hours ago

























                          answered 9 hours ago









                          Jonathan AllanJonathan Allan

                          52.3k535170




                          52.3k535170























                              3












                              $begingroup$


                              05AB1E (legacy), 5 bytes



                              The input is 1-indexed.



                              Code:



                              µN¥ÄP


                              Uses the 05AB1E encoding. Try it online!






                              Explanation



                              µ          # Get the nth number, starting from 0, such that...
                              Ä # The absolute values
                              N¥ # Of the delta's of N
                              P # Are all 1 (product function, basically acts as a reduce by AND)





                              share|improve this answer











                              $endgroup$













                              • $begingroup$
                                Right tool for the job.
                                $endgroup$
                                – lirtosiast
                                1 hour ago
















                              3












                              $begingroup$


                              05AB1E (legacy), 5 bytes



                              The input is 1-indexed.



                              Code:



                              µN¥ÄP


                              Uses the 05AB1E encoding. Try it online!






                              Explanation



                              µ          # Get the nth number, starting from 0, such that...
                              Ä # The absolute values
                              N¥ # Of the delta's of N
                              P # Are all 1 (product function, basically acts as a reduce by AND)





                              share|improve this answer











                              $endgroup$













                              • $begingroup$
                                Right tool for the job.
                                $endgroup$
                                – lirtosiast
                                1 hour ago














                              3












                              3








                              3





                              $begingroup$


                              05AB1E (legacy), 5 bytes



                              The input is 1-indexed.



                              Code:



                              µN¥ÄP


                              Uses the 05AB1E encoding. Try it online!






                              Explanation



                              µ          # Get the nth number, starting from 0, such that...
                              Ä # The absolute values
                              N¥ # Of the delta's of N
                              P # Are all 1 (product function, basically acts as a reduce by AND)





                              share|improve this answer











                              $endgroup$




                              05AB1E (legacy), 5 bytes



                              The input is 1-indexed.



                              Code:



                              µN¥ÄP


                              Uses the 05AB1E encoding. Try it online!






                              Explanation



                              µ          # Get the nth number, starting from 0, such that...
                              Ä # The absolute values
                              N¥ # Of the delta's of N
                              P # Are all 1 (product function, basically acts as a reduce by AND)






                              share|improve this answer














                              share|improve this answer



                              share|improve this answer








                              edited 7 hours ago

























                              answered 7 hours ago









                              AdnanAdnan

                              35.5k562225




                              35.5k562225












                              • $begingroup$
                                Right tool for the job.
                                $endgroup$
                                – lirtosiast
                                1 hour ago


















                              • $begingroup$
                                Right tool for the job.
                                $endgroup$
                                – lirtosiast
                                1 hour ago
















                              $begingroup$
                              Right tool for the job.
                              $endgroup$
                              – lirtosiast
                              1 hour ago




                              $begingroup$
                              Right tool for the job.
                              $endgroup$
                              – lirtosiast
                              1 hour ago











                              2












                              $begingroup$


                              C (gcc), 90 bytes





                              f(n,K,b,k){for(K=0;n;b&&printf("%d,",K,n--))for(b=k=++K;k/10;)b*=abs(k%10-(k/=10)%10)==1;}


                              Try it online!






                              share|improve this answer









                              $endgroup$


















                                2












                                $begingroup$


                                C (gcc), 90 bytes





                                f(n,K,b,k){for(K=0;n;b&&printf("%d,",K,n--))for(b=k=++K;k/10;)b*=abs(k%10-(k/=10)%10)==1;}


                                Try it online!






                                share|improve this answer









                                $endgroup$
















                                  2












                                  2








                                  2





                                  $begingroup$


                                  C (gcc), 90 bytes





                                  f(n,K,b,k){for(K=0;n;b&&printf("%d,",K,n--))for(b=k=++K;k/10;)b*=abs(k%10-(k/=10)%10)==1;}


                                  Try it online!






                                  share|improve this answer









                                  $endgroup$




                                  C (gcc), 90 bytes





                                  f(n,K,b,k){for(K=0;n;b&&printf("%d,",K,n--))for(b=k=++K;k/10;)b*=abs(k%10-(k/=10)%10)==1;}


                                  Try it online!







                                  share|improve this answer












                                  share|improve this answer



                                  share|improve this answer










                                  answered 9 hours ago









                                  Jonathan FrechJonathan Frech

                                  6,34311040




                                  6,34311040























                                      2












                                      $begingroup$

                                      Japt, 14 bytes



                                      Outputs the first nth term, 1-indexed.



                                      _ì äa dÉ ªU´}f


                                      Try it



                                      (I know, I know, I'm supposed to be taking a break but I'm in golf withdrawal!)






                                      share|improve this answer











                                      $endgroup$













                                      • $begingroup$
                                        Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                        $endgroup$
                                        – Quintec
                                        7 hours ago
















                                      2












                                      $begingroup$

                                      Japt, 14 bytes



                                      Outputs the first nth term, 1-indexed.



                                      _ì äa dÉ ªU´}f


                                      Try it



                                      (I know, I know, I'm supposed to be taking a break but I'm in golf withdrawal!)






                                      share|improve this answer











                                      $endgroup$













                                      • $begingroup$
                                        Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                        $endgroup$
                                        – Quintec
                                        7 hours ago














                                      2












                                      2








                                      2





                                      $begingroup$

                                      Japt, 14 bytes



                                      Outputs the first nth term, 1-indexed.



                                      _ì äa dÉ ªU´}f


                                      Try it



                                      (I know, I know, I'm supposed to be taking a break but I'm in golf withdrawal!)






                                      share|improve this answer











                                      $endgroup$



                                      Japt, 14 bytes



                                      Outputs the first nth term, 1-indexed.



                                      _ì äa dÉ ªU´}f


                                      Try it



                                      (I know, I know, I'm supposed to be taking a break but I'm in golf withdrawal!)







                                      share|improve this answer














                                      share|improve this answer



                                      share|improve this answer








                                      edited 7 hours ago

























                                      answered 9 hours ago









                                      ShaggyShaggy

                                      19.5k21667




                                      19.5k21667












                                      • $begingroup$
                                        Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                        $endgroup$
                                        – Quintec
                                        7 hours ago


















                                      • $begingroup$
                                        Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                        $endgroup$
                                        – Quintec
                                        7 hours ago
















                                      $begingroup$
                                      Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                      $endgroup$
                                      – Quintec
                                      7 hours ago




                                      $begingroup$
                                      Haha, maybe go learn a new golfing language to cure your withdrawal. :P
                                      $endgroup$
                                      – Quintec
                                      7 hours ago











                                      2












                                      $begingroup$


                                      Python 2, 88 87 bytes





                                      f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                      g=lambda i:i<10or abs(i/10%10-i%10)==1==g(i/10)


                                      Try it online!



                                      Returns the 0-indexed jumping number (i.e., f(0) => 1, etc).






                                      share|improve this answer











                                      $endgroup$













                                      • $begingroup$
                                        Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                        $endgroup$
                                        – lirtosiast
                                        1 hour ago












                                      • $begingroup$
                                        @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                        $endgroup$
                                        – Chas Brown
                                        39 mins ago
















                                      2












                                      $begingroup$


                                      Python 2, 88 87 bytes





                                      f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                      g=lambda i:i<10or abs(i/10%10-i%10)==1==g(i/10)


                                      Try it online!



                                      Returns the 0-indexed jumping number (i.e., f(0) => 1, etc).






                                      share|improve this answer











                                      $endgroup$













                                      • $begingroup$
                                        Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                        $endgroup$
                                        – lirtosiast
                                        1 hour ago












                                      • $begingroup$
                                        @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                        $endgroup$
                                        – Chas Brown
                                        39 mins ago














                                      2












                                      2








                                      2





                                      $begingroup$


                                      Python 2, 88 87 bytes





                                      f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                      g=lambda i:i<10or abs(i/10%10-i%10)==1==g(i/10)


                                      Try it online!



                                      Returns the 0-indexed jumping number (i.e., f(0) => 1, etc).






                                      share|improve this answer











                                      $endgroup$




                                      Python 2, 88 87 bytes





                                      f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                      g=lambda i:i<10or abs(i/10%10-i%10)==1==g(i/10)


                                      Try it online!



                                      Returns the 0-indexed jumping number (i.e., f(0) => 1, etc).







                                      share|improve this answer














                                      share|improve this answer



                                      share|improve this answer








                                      edited 5 hours ago

























                                      answered 6 hours ago









                                      Chas BrownChas Brown

                                      4,9841523




                                      4,9841523












                                      • $begingroup$
                                        Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                        $endgroup$
                                        – lirtosiast
                                        1 hour ago












                                      • $begingroup$
                                        @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                        $endgroup$
                                        – Chas Brown
                                        39 mins ago


















                                      • $begingroup$
                                        Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                        $endgroup$
                                        – lirtosiast
                                        1 hour ago












                                      • $begingroup$
                                        @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                        $endgroup$
                                        – Chas Brown
                                        39 mins ago
















                                      $begingroup$
                                      Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                      $endgroup$
                                      – lirtosiast
                                      1 hour ago






                                      $begingroup$
                                      Do you want the 79-byte answer tio.run/##XcyxCsIwGATgvU9xSyDBFvPXyWJ8keIQqYk/… or should I claim it myself?
                                      $endgroup$
                                      – lirtosiast
                                      1 hour ago














                                      $begingroup$
                                      @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                      $endgroup$
                                      – Chas Brown
                                      39 mins ago




                                      $begingroup$
                                      @lirtosiast : That's OK, please donate your answer to your favorite charity :). It's sufficiently different to merit a separate response (as well as being cross-language appropriate).
                                      $endgroup$
                                      – Chas Brown
                                      39 mins ago











                                      1












                                      $begingroup$

                                      JavaScript (ES7), 60 bytes



                                      Returns the $n$th term of the sequence (1-indexed).





                                      f=(n,k)=>[...k+''].some(p=x=>(p-(p=x))**2-1)||n--?f(n,-~k):k


                                      Try it online!






                                      share|improve this answer









                                      $endgroup$


















                                        1












                                        $begingroup$

                                        JavaScript (ES7), 60 bytes



                                        Returns the $n$th term of the sequence (1-indexed).





                                        f=(n,k)=>[...k+''].some(p=x=>(p-(p=x))**2-1)||n--?f(n,-~k):k


                                        Try it online!






                                        share|improve this answer









                                        $endgroup$
















                                          1












                                          1








                                          1





                                          $begingroup$

                                          JavaScript (ES7), 60 bytes



                                          Returns the $n$th term of the sequence (1-indexed).





                                          f=(n,k)=>[...k+''].some(p=x=>(p-(p=x))**2-1)||n--?f(n,-~k):k


                                          Try it online!






                                          share|improve this answer









                                          $endgroup$



                                          JavaScript (ES7), 60 bytes



                                          Returns the $n$th term of the sequence (1-indexed).





                                          f=(n,k)=>[...k+''].some(p=x=>(p-(p=x))**2-1)||n--?f(n,-~k):k


                                          Try it online!







                                          share|improve this answer












                                          share|improve this answer



                                          share|improve this answer










                                          answered 9 hours ago









                                          ArnauldArnauld

                                          77.5k694324




                                          77.5k694324























                                              1












                                              $begingroup$


                                              Jelly, 9 bytes



                                              -1 by Jonathan Allan



                                              1DạƝ=1ẠƲ#


                                              Try it online!



                                              1-indexed.






                                              share|improve this answer











                                              $endgroup$













                                              • $begingroup$
                                                9 bytes by reading STDIN
                                                $endgroup$
                                                – Jonathan Allan
                                                9 hours ago


















                                              1












                                              $begingroup$


                                              Jelly, 9 bytes



                                              -1 by Jonathan Allan



                                              1DạƝ=1ẠƲ#


                                              Try it online!



                                              1-indexed.






                                              share|improve this answer











                                              $endgroup$













                                              • $begingroup$
                                                9 bytes by reading STDIN
                                                $endgroup$
                                                – Jonathan Allan
                                                9 hours ago
















                                              1












                                              1








                                              1





                                              $begingroup$


                                              Jelly, 9 bytes



                                              -1 by Jonathan Allan



                                              1DạƝ=1ẠƲ#


                                              Try it online!



                                              1-indexed.






                                              share|improve this answer











                                              $endgroup$




                                              Jelly, 9 bytes



                                              -1 by Jonathan Allan



                                              1DạƝ=1ẠƲ#


                                              Try it online!



                                              1-indexed.







                                              share|improve this answer














                                              share|improve this answer



                                              share|improve this answer








                                              edited 7 hours ago

























                                              answered 9 hours ago









                                              lirtosiastlirtosiast

                                              18k437109




                                              18k437109












                                              • $begingroup$
                                                9 bytes by reading STDIN
                                                $endgroup$
                                                – Jonathan Allan
                                                9 hours ago




















                                              • $begingroup$
                                                9 bytes by reading STDIN
                                                $endgroup$
                                                – Jonathan Allan
                                                9 hours ago


















                                              $begingroup$
                                              9 bytes by reading STDIN
                                              $endgroup$
                                              – Jonathan Allan
                                              9 hours ago






                                              $begingroup$
                                              9 bytes by reading STDIN
                                              $endgroup$
                                              – Jonathan Allan
                                              9 hours ago













                                              1












                                              $begingroup$


                                              Haskell, 79 bytes




                                              • Thanks to Joseph Sible for enforcing the challenge rules.


                                              f=(filter g[1..]!!)
                                              g m|d<-read.pure<$>show m=all((==1).abs).zipWith(-)d$tail d


                                              Try it online!






                                              share|improve this answer











                                              $endgroup$









                                              • 1




                                                $begingroup$
                                                This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                                $endgroup$
                                                – Joseph Sible
                                                8 hours ago










                                              • $begingroup$
                                                @JosephSible You are correct. Thank you for noting.
                                                $endgroup$
                                                – Jonathan Frech
                                                4 hours ago
















                                              1












                                              $begingroup$


                                              Haskell, 79 bytes




                                              • Thanks to Joseph Sible for enforcing the challenge rules.


                                              f=(filter g[1..]!!)
                                              g m|d<-read.pure<$>show m=all((==1).abs).zipWith(-)d$tail d


                                              Try it online!






                                              share|improve this answer











                                              $endgroup$









                                              • 1




                                                $begingroup$
                                                This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                                $endgroup$
                                                – Joseph Sible
                                                8 hours ago










                                              • $begingroup$
                                                @JosephSible You are correct. Thank you for noting.
                                                $endgroup$
                                                – Jonathan Frech
                                                4 hours ago














                                              1












                                              1








                                              1





                                              $begingroup$


                                              Haskell, 79 bytes




                                              • Thanks to Joseph Sible for enforcing the challenge rules.


                                              f=(filter g[1..]!!)
                                              g m|d<-read.pure<$>show m=all((==1).abs).zipWith(-)d$tail d


                                              Try it online!






                                              share|improve this answer











                                              $endgroup$




                                              Haskell, 79 bytes




                                              • Thanks to Joseph Sible for enforcing the challenge rules.


                                              f=(filter g[1..]!!)
                                              g m|d<-read.pure<$>show m=all((==1).abs).zipWith(-)d$tail d


                                              Try it online!







                                              share|improve this answer














                                              share|improve this answer



                                              share|improve this answer








                                              edited 3 hours ago

























                                              answered 9 hours ago









                                              Jonathan FrechJonathan Frech

                                              6,34311040




                                              6,34311040








                                              • 1




                                                $begingroup$
                                                This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                                $endgroup$
                                                – Joseph Sible
                                                8 hours ago










                                              • $begingroup$
                                                @JosephSible You are correct. Thank you for noting.
                                                $endgroup$
                                                – Jonathan Frech
                                                4 hours ago














                                              • 1




                                                $begingroup$
                                                This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                                $endgroup$
                                                – Joseph Sible
                                                8 hours ago










                                              • $begingroup$
                                                @JosephSible You are correct. Thank you for noting.
                                                $endgroup$
                                                – Jonathan Frech
                                                4 hours ago








                                              1




                                              1




                                              $begingroup$
                                              This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                              $endgroup$
                                              – Joseph Sible
                                              8 hours ago




                                              $begingroup$
                                              This appears to answer the question "is this a jumping number?" for a given input number, which isn't what the challenge asked for.
                                              $endgroup$
                                              – Joseph Sible
                                              8 hours ago












                                              $begingroup$
                                              @JosephSible You are correct. Thank you for noting.
                                              $endgroup$
                                              – Jonathan Frech
                                              4 hours ago




                                              $begingroup$
                                              @JosephSible You are correct. Thank you for noting.
                                              $endgroup$
                                              – Jonathan Frech
                                              4 hours ago











                                              1












                                              $begingroup$


                                              Haskell, 57 bytes





                                              (l!!)
                                              l=[1..9]++[x*10+t|x<-l,t<-[0..9],(mod x 10-t)^2==1]


                                              Try it online!






                                              share|improve this answer











                                              $endgroup$


















                                                1












                                                $begingroup$


                                                Haskell, 57 bytes





                                                (l!!)
                                                l=[1..9]++[x*10+t|x<-l,t<-[0..9],(mod x 10-t)^2==1]


                                                Try it online!






                                                share|improve this answer











                                                $endgroup$
















                                                  1












                                                  1








                                                  1





                                                  $begingroup$


                                                  Haskell, 57 bytes





                                                  (l!!)
                                                  l=[1..9]++[x*10+t|x<-l,t<-[0..9],(mod x 10-t)^2==1]


                                                  Try it online!






                                                  share|improve this answer











                                                  $endgroup$




                                                  Haskell, 57 bytes





                                                  (l!!)
                                                  l=[1..9]++[x*10+t|x<-l,t<-[0..9],(mod x 10-t)^2==1]


                                                  Try it online!







                                                  share|improve this answer














                                                  share|improve this answer



                                                  share|improve this answer








                                                  edited 3 hours ago

























                                                  answered 3 hours ago









                                                  xnorxnor

                                                  91.5k18186443




                                                  91.5k18186443























                                                      0












                                                      $begingroup$

                                                      Swift, 228 bytes



                                                      func j(n:Int){
                                                      var r:[Int]=
                                                      for x in 0...n{
                                                      if x<=10{r.append(x)}else{
                                                      let t=String(x).compactMap{Int(String($0))}
                                                      var b=true
                                                      for i in 1...t.count-1{if abs(t[i-1]-t[i]) != 1{b=false}}
                                                      if b{r.append(x)}
                                                      }
                                                      }
                                                      print(r)
                                                      }
                                                      j(n:1000)


                                                      Try it online!






                                                      share|improve this answer











                                                      $endgroup$


















                                                        0












                                                        $begingroup$

                                                        Swift, 228 bytes



                                                        func j(n:Int){
                                                        var r:[Int]=
                                                        for x in 0...n{
                                                        if x<=10{r.append(x)}else{
                                                        let t=String(x).compactMap{Int(String($0))}
                                                        var b=true
                                                        for i in 1...t.count-1{if abs(t[i-1]-t[i]) != 1{b=false}}
                                                        if b{r.append(x)}
                                                        }
                                                        }
                                                        print(r)
                                                        }
                                                        j(n:1000)


                                                        Try it online!






                                                        share|improve this answer











                                                        $endgroup$
















                                                          0












                                                          0








                                                          0





                                                          $begingroup$

                                                          Swift, 228 bytes



                                                          func j(n:Int){
                                                          var r:[Int]=
                                                          for x in 0...n{
                                                          if x<=10{r.append(x)}else{
                                                          let t=String(x).compactMap{Int(String($0))}
                                                          var b=true
                                                          for i in 1...t.count-1{if abs(t[i-1]-t[i]) != 1{b=false}}
                                                          if b{r.append(x)}
                                                          }
                                                          }
                                                          print(r)
                                                          }
                                                          j(n:1000)


                                                          Try it online!






                                                          share|improve this answer











                                                          $endgroup$



                                                          Swift, 228 bytes



                                                          func j(n:Int){
                                                          var r:[Int]=
                                                          for x in 0...n{
                                                          if x<=10{r.append(x)}else{
                                                          let t=String(x).compactMap{Int(String($0))}
                                                          var b=true
                                                          for i in 1...t.count-1{if abs(t[i-1]-t[i]) != 1{b=false}}
                                                          if b{r.append(x)}
                                                          }
                                                          }
                                                          print(r)
                                                          }
                                                          j(n:1000)


                                                          Try it online!







                                                          share|improve this answer














                                                          share|improve this answer



                                                          share|improve this answer








                                                          edited 8 hours ago









                                                          Shaggy

                                                          19.5k21667




                                                          19.5k21667










                                                          answered 8 hours ago









                                                          onnowebonnoweb

                                                          1212




                                                          1212























                                                              0












                                                              $begingroup$


                                                              Python 3, 122 121 bytes





                                                              g=lambda s:len(s)==1or 1==abs(ord(s[0])-ord(s[1]))and g(s[1:])
                                                              def f(n,i=1):
                                                              while n:
                                                              if g(str(i)):n-=1;yield i
                                                              i+=1


                                                              Try it online!



                                                              -1 byte by changing f from printing, to a generator function.



                                                              g is a recursive helper function which determines if a string s is a "jumping string" (this works since the character codes for 0 to 9 are in order and contiguous).



                                                              f is a generator function that takes in n and yields the first n jumping numbers.






                                                              share|improve this answer









                                                              $endgroup$


















                                                                0












                                                                $begingroup$


                                                                Python 3, 122 121 bytes





                                                                g=lambda s:len(s)==1or 1==abs(ord(s[0])-ord(s[1]))and g(s[1:])
                                                                def f(n,i=1):
                                                                while n:
                                                                if g(str(i)):n-=1;yield i
                                                                i+=1


                                                                Try it online!



                                                                -1 byte by changing f from printing, to a generator function.



                                                                g is a recursive helper function which determines if a string s is a "jumping string" (this works since the character codes for 0 to 9 are in order and contiguous).



                                                                f is a generator function that takes in n and yields the first n jumping numbers.






                                                                share|improve this answer









                                                                $endgroup$
















                                                                  0












                                                                  0








                                                                  0





                                                                  $begingroup$


                                                                  Python 3, 122 121 bytes





                                                                  g=lambda s:len(s)==1or 1==abs(ord(s[0])-ord(s[1]))and g(s[1:])
                                                                  def f(n,i=1):
                                                                  while n:
                                                                  if g(str(i)):n-=1;yield i
                                                                  i+=1


                                                                  Try it online!



                                                                  -1 byte by changing f from printing, to a generator function.



                                                                  g is a recursive helper function which determines if a string s is a "jumping string" (this works since the character codes for 0 to 9 are in order and contiguous).



                                                                  f is a generator function that takes in n and yields the first n jumping numbers.






                                                                  share|improve this answer









                                                                  $endgroup$




                                                                  Python 3, 122 121 bytes





                                                                  g=lambda s:len(s)==1or 1==abs(ord(s[0])-ord(s[1]))and g(s[1:])
                                                                  def f(n,i=1):
                                                                  while n:
                                                                  if g(str(i)):n-=1;yield i
                                                                  i+=1


                                                                  Try it online!



                                                                  -1 byte by changing f from printing, to a generator function.



                                                                  g is a recursive helper function which determines if a string s is a "jumping string" (this works since the character codes for 0 to 9 are in order and contiguous).



                                                                  f is a generator function that takes in n and yields the first n jumping numbers.







                                                                  share|improve this answer












                                                                  share|improve this answer



                                                                  share|improve this answer










                                                                  answered 7 hours ago









                                                                  pizzapants184pizzapants184

                                                                  2,714716




                                                                  2,714716























                                                                      0












                                                                      $begingroup$


                                                                      R, 85 bytes





                                                                      i=scan();j=0;while(i)if((j=j+1)<10|all(abs(diff(j%/%10^(0:log10(j))%%10))==1))i=i-1;j


                                                                      Try it online!



                                                                      Suspect this can be golfed more. Reads the number using scan() and outputs the appropriate jumping number.






                                                                      share|improve this answer









                                                                      $endgroup$


















                                                                        0












                                                                        $begingroup$


                                                                        R, 85 bytes





                                                                        i=scan();j=0;while(i)if((j=j+1)<10|all(abs(diff(j%/%10^(0:log10(j))%%10))==1))i=i-1;j


                                                                        Try it online!



                                                                        Suspect this can be golfed more. Reads the number using scan() and outputs the appropriate jumping number.






                                                                        share|improve this answer









                                                                        $endgroup$
















                                                                          0












                                                                          0








                                                                          0





                                                                          $begingroup$


                                                                          R, 85 bytes





                                                                          i=scan();j=0;while(i)if((j=j+1)<10|all(abs(diff(j%/%10^(0:log10(j))%%10))==1))i=i-1;j


                                                                          Try it online!



                                                                          Suspect this can be golfed more. Reads the number using scan() and outputs the appropriate jumping number.






                                                                          share|improve this answer









                                                                          $endgroup$




                                                                          R, 85 bytes





                                                                          i=scan();j=0;while(i)if((j=j+1)<10|all(abs(diff(j%/%10^(0:log10(j))%%10))==1))i=i-1;j


                                                                          Try it online!



                                                                          Suspect this can be golfed more. Reads the number using scan() and outputs the appropriate jumping number.







                                                                          share|improve this answer












                                                                          share|improve this answer



                                                                          share|improve this answer










                                                                          answered 7 hours ago









                                                                          Nick KennedyNick Kennedy

                                                                          26114




                                                                          26114























                                                                              0












                                                                              $begingroup$


                                                                              Perl 5, 56 bytes





                                                                              map{1while++$n=~s|.(?=(.))|abs$&-$1!=1|ger>9}1..<>;say$n


                                                                              Try it online!



                                                                              1-indexed, outputs the nth jumping number






                                                                              share|improve this answer









                                                                              $endgroup$


















                                                                                0












                                                                                $begingroup$


                                                                                Perl 5, 56 bytes





                                                                                map{1while++$n=~s|.(?=(.))|abs$&-$1!=1|ger>9}1..<>;say$n


                                                                                Try it online!



                                                                                1-indexed, outputs the nth jumping number






                                                                                share|improve this answer









                                                                                $endgroup$
















                                                                                  0












                                                                                  0








                                                                                  0





                                                                                  $begingroup$


                                                                                  Perl 5, 56 bytes





                                                                                  map{1while++$n=~s|.(?=(.))|abs$&-$1!=1|ger>9}1..<>;say$n


                                                                                  Try it online!



                                                                                  1-indexed, outputs the nth jumping number






                                                                                  share|improve this answer









                                                                                  $endgroup$




                                                                                  Perl 5, 56 bytes





                                                                                  map{1while++$n=~s|.(?=(.))|abs$&-$1!=1|ger>9}1..<>;say$n


                                                                                  Try it online!



                                                                                  1-indexed, outputs the nth jumping number







                                                                                  share|improve this answer












                                                                                  share|improve this answer



                                                                                  share|improve this answer










                                                                                  answered 3 hours ago









                                                                                  XcaliXcali

                                                                                  5,385520




                                                                                  5,385520























                                                                                      0












                                                                                      $begingroup$


                                                                                      Wolfram Language (Mathematica), 85 bytes



                                                                                      If[#<10,#,t=n=1;While[t<=#,{-1,1}~SubsetQ~Differences@IntegerDigits@n++~If~t++];n-1]&


                                                                                      Try it online!



                                                                                      returns the n-th number






                                                                                      share|improve this answer











                                                                                      $endgroup$


















                                                                                        0












                                                                                        $begingroup$


                                                                                        Wolfram Language (Mathematica), 85 bytes



                                                                                        If[#<10,#,t=n=1;While[t<=#,{-1,1}~SubsetQ~Differences@IntegerDigits@n++~If~t++];n-1]&


                                                                                        Try it online!



                                                                                        returns the n-th number






                                                                                        share|improve this answer











                                                                                        $endgroup$
















                                                                                          0












                                                                                          0








                                                                                          0





                                                                                          $begingroup$


                                                                                          Wolfram Language (Mathematica), 85 bytes



                                                                                          If[#<10,#,t=n=1;While[t<=#,{-1,1}~SubsetQ~Differences@IntegerDigits@n++~If~t++];n-1]&


                                                                                          Try it online!



                                                                                          returns the n-th number






                                                                                          share|improve this answer











                                                                                          $endgroup$




                                                                                          Wolfram Language (Mathematica), 85 bytes



                                                                                          If[#<10,#,t=n=1;While[t<=#,{-1,1}~SubsetQ~Differences@IntegerDigits@n++~If~t++];n-1]&


                                                                                          Try it online!



                                                                                          returns the n-th number







                                                                                          share|improve this answer














                                                                                          share|improve this answer



                                                                                          share|improve this answer








                                                                                          edited 2 hours ago

























                                                                                          answered 2 hours ago









                                                                                          J42161217J42161217

                                                                                          13.1k21150




                                                                                          13.1k21150























                                                                                              0












                                                                                              $begingroup$


                                                                                              Python 2, 79 bytes





                                                                                              f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                                                                              g=lambda i:i<10or i%100%11%9==g(i/10)>0


                                                                                              Try it online!



                                                                                              Derived from Chas Brown's answer. The helper function g(i) returns whether i is a jumping number. Iff the last two digits of a number n have absolute difference 1, then n%100%11 will be either 1 or 10, so n%100%11%9 will be 1.






                                                                                              share|improve this answer









                                                                                              $endgroup$


















                                                                                                0












                                                                                                $begingroup$


                                                                                                Python 2, 79 bytes





                                                                                                f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                                                                                g=lambda i:i<10or i%100%11%9==g(i/10)>0


                                                                                                Try it online!



                                                                                                Derived from Chas Brown's answer. The helper function g(i) returns whether i is a jumping number. Iff the last two digits of a number n have absolute difference 1, then n%100%11 will be either 1 or 10, so n%100%11%9 will be 1.






                                                                                                share|improve this answer









                                                                                                $endgroup$
















                                                                                                  0












                                                                                                  0








                                                                                                  0





                                                                                                  $begingroup$


                                                                                                  Python 2, 79 bytes





                                                                                                  f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                                                                                  g=lambda i:i<10or i%100%11%9==g(i/10)>0


                                                                                                  Try it online!



                                                                                                  Derived from Chas Brown's answer. The helper function g(i) returns whether i is a jumping number. Iff the last two digits of a number n have absolute difference 1, then n%100%11 will be either 1 or 10, so n%100%11%9 will be 1.






                                                                                                  share|improve this answer









                                                                                                  $endgroup$




                                                                                                  Python 2, 79 bytes





                                                                                                  f=lambda n,i=2:n and f(n-g(i),i+1)or~-i
                                                                                                  g=lambda i:i<10or i%100%11%9==g(i/10)>0


                                                                                                  Try it online!



                                                                                                  Derived from Chas Brown's answer. The helper function g(i) returns whether i is a jumping number. Iff the last two digits of a number n have absolute difference 1, then n%100%11 will be either 1 or 10, so n%100%11%9 will be 1.







                                                                                                  share|improve this answer












                                                                                                  share|improve this answer



                                                                                                  share|improve this answer










                                                                                                  answered 33 mins ago









                                                                                                  lirtosiastlirtosiast

                                                                                                  18k437109




                                                                                                  18k437109






























                                                                                                      draft saved

                                                                                                      draft discarded




















































                                                                                                      If this is an answer to a challenge…




                                                                                                      • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                                                                                                      • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                                                                                        Explanations of your answer make it more interesting to read and are very much encouraged.


                                                                                                      • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



                                                                                                      More generally…




                                                                                                      • …Please make sure to answer the question and provide sufficient detail.


                                                                                                      • …Avoid asking for help, clarification or responding to other answers (use comments instead).





                                                                                                      draft saved


                                                                                                      draft discarded














                                                                                                      StackExchange.ready(
                                                                                                      function () {
                                                                                                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180693%2fjumping-numbers%23new-answer', 'question_page');
                                                                                                      }
                                                                                                      );

                                                                                                      Post as a guest















                                                                                                      Required, but never shown





















































                                                                                                      Required, but never shown














                                                                                                      Required, but never shown












                                                                                                      Required, but never shown







                                                                                                      Required, but never shown

































                                                                                                      Required, but never shown














                                                                                                      Required, but never shown












                                                                                                      Required, but never shown







                                                                                                      Required, but never shown







                                                                                                      Popular posts from this blog

                                                                                                      GameSpot

                                                                                                      日野市

                                                                                                      Tu-95轟炸機