New Neighbour Sequence

Question

The non-negative integers are bored of always having the same two* neighbours, so they decide to mix things up a little. However, they are also lazy and want to stay as close as possible to their original position.

They come up with the following algorithm:

The first element is 0.
The \$n^{th}\$ element is the smallest number which is not yet present in the sequence and which is not a neighbour of the \$(n-1)^{th}\$ element.

This generates the following infinite sequence:

0,2,4,1,3,5,7,9,6,8,10,12,14,11,13,15,17,19,16,18,20,22,24,21,23,25,27,29,26,28 ...

0 is the first element. 1 is the smallest number not yet in the sequence, but it is a neighbour of 0. The next smallest number is 2, so it is the second element of the sequence. Now the remaining numbers are 1,3,4,5,6,..., but as both 1 and 3 are neighbours of 2, 4 is the third member of the sequence. As 1 is not a neighbour of 4, it can finally take its place as fourth element.

The Task

Write a function or program in as few bytes as possible which generates the above sequence.

You may

output the sequence infinitely,
take an input \$n\$ and return the \$n^{th}\$ element of the sequence, or
take an input \$n\$ and return the first \$n\$ elements of the sequence.

Both zero- or one-indexing is fine in case you choose one of the two latter options.

You don't need to follow the algorithm given above, any method which produces the same sequence is fine.

^{Inspired by Code golf the best permutation. Turns out this is A277618.}
_{* Zero has literally only one neighbour and doesn't really care.}

\$\begingroup\$ Sandbox post (deleted) \$\endgroup\$
– Laikoni
Commented Oct 25, 2018 at 18:01 — Laikoni, Commented Oct 25, 2018 at 18:01

Community · Accepted Answer · 2020-06-17 09:04:33Z

19

JavaScript (ES6), 13 bytes

Returns the \$n\$^th term of the sequence.

n=>n-2-~++n%5

Try it online!

How?

This computes:

$$n-2+((n+2) \bmod 5)$$

           n |  0  1  2  3  4  5  6  7  8  9 10 11 12 13 14 ...
-------------+--------------------------------------------------
       n - 2 | -2 -1  0  1  2  3  4  5  6  7  8  9 10 11 12 ...
 (n+2) mod 5 |  2  3  4  0  1  2  3  4  0  1  2  3  4  0  1 ...
-------------+--------------------------------------------------
         sum |  0  2  4  1  3  5  7  9  6  8 10 12 14 11 13 ...

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 25, 2018 at 19:17

Arnauld

198k20 gold badges179 silver badges649 bronze badges

Add a comment |

Chas Brown · Accepted Answer · 2018-10-25 18:13:48Z

8

Python 2, 20 bytes

lambda n:2*n%5+n/5*5

Try it online!

answered Oct 25, 2018 at 18:13

Chas Brown

9,7571 gold badge13 silver badges39 bronze badges

Add a comment |

Jo King · Accepted Answer · 2018-10-25 22:05:53Z

8

MathGolf, 5 bytes

⌠5%+⌡

Try it online!

Some nice symmetry here. Returns the nth element of the sequence.

Explanation:

⌠      Increment input by 2
 5%    Modulo by 5
   +   Add to copy of input
    ⌡  Decrement by 2

answered Oct 25, 2018 at 22:05

Jo King♦

47.5k5 gold badges125 silver badges186 bronze badges

Add a comment |

lynn · Accepted Answer · 2018-10-26 01:39:03Z

6

Jelly, 5 bytes

æ%2.+

Try it online!

Go go gadget obscure built-in!

æ%2.      Symmetric modulo 5: map [0,1,2,3,4,5,6,7,8,9] to [0,1,2,-2,-1,0,1,2,-2,-1]
    +     Add to input

edited Oct 26, 2018 at 1:39

answered Oct 26, 2018 at 1:37

lynn

69.2k11 gold badges133 silver badges283 bronze badges

Add a comment |

Misha Lavrov · Accepted Answer · 2018-10-25 18:12:26Z

4

Wolfram Language (Mathematica), 14 bytes

#+Mod[#,5,-2]&

Try it online!

Prints the n-th, zero-indexed, integer in the sequence.

answered Oct 25, 2018 at 18:12

Misha Lavrov

5,26513 silver badges27 bronze badges

Add a comment |

Robert S. · Accepted Answer · 2019-04-24 15:01:48Z

4

R, 25 23 21 bytes

-2 bytes thanks to Jo King

n=scan();n-2+(n+2)%%5

Try it online!

Outputs nth element in sequence.

edited Apr 24, 2019 at 15:01

answered Oct 25, 2018 at 22:11

Robert S.

1,32311 silver badges17 bronze badges

Add a comment |

Quintec · Accepted Answer · 2018-10-25 23:36:41Z

3

dzaima/APL, 9 bytes

2-⍨⊢+5|2+

Port of Arnauld's answer.

Try it online!

answered Oct 25, 2018 at 23:36

Quintec

2,8691 gold badge15 silver badges28 bronze badges

Add a comment |

DLosc · Accepted Answer · 2018-10-28 04:15:55Z

3

Pip, 14 bytes

02413@a+a//5*5

Takes \$n\$ (0-based) as a command-line argument and outputs \$a_n\$. Try it online!

Observe that \$a_{n+5} = a_n+5\$. We hard-code the first five values and offset from there.

Or, the formula everyone's using, for 12 bytes:

a-2+(a+2)%5

edited Oct 28, 2018 at 4:15

answered Oct 28, 2018 at 4:02

DLosc

39.2k5 gold badges83 silver badges141 bronze badges

Add a comment |

JRowan · Accepted Answer · 2018-10-25 19:40:03Z

2

Common Lisp, 67 bytes

(defun x(n)(loop for a from 0 to n collect(+(mod(+ a 2)5)(- a 2))))

Try it online!

answered Oct 25, 2018 at 19:40

JRowan

2311 silver badge4 bronze badges

\$\begingroup\$ I think just (defun x(n)(+(mod(+ n 2)5)(- n 2))), or (lambda(n)(+(mod(+ n 2)5)(- n 2))) is enough: returning the n-th term, rather than a sequence of terms. \$\endgroup\$
– Misha Lavrov
Commented Oct 25, 2018 at 20:59

Add a comment |

Kamil Drakari · Accepted Answer · 2018-10-25 23:16:34Z

2

Japt, 8 bytes

U-2Ò°U%5

Japt Interpreter

A straight port of Arnauld's Javascript answer. The linked version runs through the first n elements, but if the -m flag is removed it is still valid and prints the nth element instead.

For comparison's sake, here is the naive version which implements the algorithm provided in the question:

@_aX É«NøZ}a}gNhT

I'll give an explanation for this one:

              NhT    Set N to [0]
@           }g       Get the nth element of N by filling each index with:
 _        }a          The first integer that satisfies:
  aX É                 It is not a neighbor to the previous element
      «NøZ             And it is not already in N

edited Oct 25, 2018 at 23:16

answered Oct 25, 2018 at 21:44

Kamil Drakari

4,36111 silver badges21 bronze badges

\$\begingroup\$ -3 bytes on your second solution, and can probably be improved further. \$\endgroup\$
– Shaggy
Commented Oct 25, 2018 at 23:02

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

2

05AB1E, 5 bytes

Ì5%+Í

Port of @JoKing's MathGolf answer.

Try it online or verify the first 100 numbers.

Explanation:

Ì        # Increase the (implicit) input by 2
 5%      # Take modulo-5
   +     # Add the (implicit) input to it
    Í    # Decrease by 2 (and output implicitly)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 26, 2018 at 7:35

Kevin Cruijssen

131k13 gold badges144 silver badges384 bronze badges

Add a comment |

Οurous · Accepted Answer · 2018-10-26 08:05:50Z

2

Clean, 31 bytes

The formula everyone's using.

import StdEnv
?n=n-2+(n+2)rem 5

Try it online!

Clean, 80 bytes

My initial approach, returning the first n items.

import StdEnv
$n=iter n(\l=l++[hd[i\\i<-[0..]|all((<>)i)l&&abs(i-last l)>1]])[0]

Try it online!

answered Oct 26, 2018 at 8:05

Οurous

8,1271 gold badge16 silver badges38 bronze badges

Add a comment |

alephalpha · Accepted Answer · 2018-10-26 09:12:27Z

2

Pari/GP, 14 bytes

n->2*n%5+n\5*5

Try it online!

Pari/GP, 14 bytes

n->n-2+(n+2)%5

Try it online!

answered Oct 26, 2018 at 9:12

alephalpha

50k7 gold badges68 silver badges182 bronze badges

Add a comment |

Galen Ivanov · Accepted Answer · 2018-10-26 12:24:10Z

J, 30 bytes

{.2}.[:,_5,./\2(i.-4 0$~])@,~]

Try it online!

Returns a list of first n numbers

This solution is obviously non-competitve, but I wanted to try an array-based method.

Explanation:

The argument is n

2 ,] - append 2 to the input

   (2,~]) 10
10 2

()@ - and use this list to:

i. - create a matrix n x 2 with the numbers in the range 0..2n-1:

4 0$~] - ~ reverses the arguments, so it is ]$4 0 - creates matrix n x 2 repeating 4 0

- subtract the second matrix from the first one, so that the first column is "delayed" with 2 positions

   2(i.-4 0$~])@,~] 10
_4  1
_2  3
 0  5
 2  7
 4  9
 6 11
 8 13
10 15
12 17
14 19

_5,./\ traverse the matrix in non-overlapping groups of 5 rows and stitch the columns

   _5,./\2(i.-4 0$~])@,~] 10
_4 _2  0  2  4
 1  3  5  7  9

 6  8 10 12 14
11 13 15 17 19

[:, ravel the entire array

   ,_5,./\2(i.-4 0$~])@,~] 10
_4 _2 0 2 4 1 3 5 7 9 6 8 10 12 14 11 13 15 17 19

2}. - drop the first 2 numbers

   2}.,_5,./\2(i.-4 0$~])@,~] 10
0 2 4 1 3 5 7 9 6 8 10 12 14 11 13 15 17 19

{. take the first n numbers

   ({.2}.[:,_5,./\2(i.-4 0$~])@,~]) 10
0 2 4 1 3 5 7 9 6 8

J, 9 bytes

+_2+5|2+]

Try it online!

Returns the nth element.

Port of Arnauld's answer

Thaufeki · Accepted Answer · 2018-10-28 02:56:41Z

2

K (ngn/k), 12 bytes

{-2+x+5!x+2}

Try it online!

answered Oct 28, 2018 at 2:56

Thaufeki

4913 silver badges10 bronze badges

1

\$\begingroup\$ -2+x+ -> x-2- \$\endgroup\$
– ngn
Commented Nov 3, 2018 at 14:01

Add a comment |

u-ndefined · Accepted Answer · 2018-10-28 03:47:07Z

2

Pepe, 65 bytes

REeeeeeeEerEeERRrEEEEEERREeeeeeEeErEEeEeErRrEEEEEEEErRrEEEEEereEE

Try it online!

Port of Jo King's answer.

answered Oct 28, 2018 at 3:47

u-ndefined

2,32311 silver badges21 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

x86 machine code, 16 bytes

00000000: 31d2 89c8 4949 4040 b305 f7f3 9201 c8c3 1...II@@........

Assembly:

section .text
	global func
func:	;function uses fastcall conventions, 1st arg in ecx, returns in eax
	;reset edx to 0 so division works
	xor edx, edx

	mov eax, ecx
	;calculate ecx (1st func arg) - 2
	dec ecx
	dec ecx

	;calculate (ecx+2) mod 5
	inc eax
	inc eax
	mov bl, 5
	div ebx
	xchg eax, edx
	
	;add (ecx-2) and ((ecx+2) mod 5), returning in eax
	add eax, ecx
	ret

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 25, 2018 at 22:57

user36046

Add a comment |

Galen Ivanov · Accepted Answer · 2018-10-26 08:36:52Z

1

Red, 26 bytes

func[n][n + 2 % 5 + n - 2]

Try it online!

Port of Arnauld's answer

answered Oct 26, 2018 at 8:36

Galen Ivanov

21.2k3 gold badges24 silver badges61 bronze badges

Add a comment |

Wernisch · Accepted Answer · 2018-10-26 08:43:59Z

1

Excel, 17 bytes

=A1-2+MOD(A1+2,5)

Nothing smart. Implements the common formula.

answered Oct 26, 2018 at 8:43

Wernisch

3,03410 silver badges22 bronze badges

Add a comment |

Addict · Accepted Answer · 2018-10-26 09:06:57Z

1

C (gcc) POSIX, 20 bytes

f(n){n=n-2+(n+2)%5;}

Try it online!

answered Oct 26, 2018 at 9:06

Addict

314 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

QBasic, 30 bytes

INPUT x 
x=x+2 
?-4+x*2-(x\5)*5

Gives the 0-indexed entry of the list at pos x.

Try it online! (Note that ? was expanded to PRINT because the interpreter fails otherwise...)

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Oct 26, 2018 at 11:25

steenbergh

8,1441 gold badge25 silver badges41 bronze badges

Add a comment |

aloisdg · Accepted Answer · 2018-10-26 12:23:02Z

1

C# (Visual C# Interactive Compiler), 14 bytes

n=>2*n%5+n/5*5

Try it online!

Same logic than others answers: 1 2

answered Oct 26, 2018 at 12:23

aloisdg

2,07717 silver badges26 bronze badges

Add a comment |

absoluteAquarian · Accepted Answer · 2019-04-24 16:48:32Z

1

TI-BASIC, 11 bytes

Ans-2+remainder(Ans+2,5

Input is in Ans.
Outputs \$a(n)\$.

A simple port of the other answers.

Note: TI-BASIC is a tokenized language. Character count does not equal byte count.

answered Apr 24, 2019 at 16:48

absoluteAquarian

2,6531 gold badge10 silver badges23 bronze badges

Add a comment |

Sumner18 · Accepted Answer · 2019-04-24 19:17:21Z

1

R, 25 bytes

n=1:scan()-1;n-2+(n+2)%%5

Try it online!

Port of Robert S.'s answer (and only by adding just 4 bytes) thanks to R being excellent at handling vectors.

Outputs the first n values.

answered Apr 24, 2019 at 19:17

Sumner18

1,9269 silver badges19 bronze badges

Add a comment |

brhfl · Accepted Answer · 2019-04-24 20:54:45Z

1

dc, 9 bytes

d2+5%+2-p

Try it online!

Same method as most. Duplicate top-of-stack, add 2, mod 5, add to original (duplicated earlier), subtract 2, print.

answered Apr 24, 2019 at 20:54

brhfl

1,49111 silver badges14 bronze badges

Add a comment |

Stack Exchange Network

New Neighbour Sequence

The Task

25 Answers 25

JavaScript (ES6), 13 bytes

How?

Python 2, 20 bytes

MathGolf, 5 bytes

Explanation:

Jelly, 5 bytes

Wolfram Language (Mathematica), 14 bytes

R, 25 23 21 bytes

dzaima/APL, 9 bytes

Pip, 14 bytes

Common Lisp, 67 bytes

Japt, 8 bytes

05AB1E, 5 bytes

Clean, 31 bytes

Clean, 80 bytes

Pari/GP, 14 bytes

Pari/GP, 14 bytes

J, 30 bytes

Explanation:

J, 9 bytes

K (ngn/k), 12 bytes

Pepe, 65 bytes

x86 machine code, 16 bytes

Red, 26 bytes

Excel, 17 bytes

C (gcc) POSIX, 20 bytes

QBasic, 30 bytes

C# (Visual C# Interactive Compiler), 14 bytes

TI-BASIC, 11 bytes

R, 25 bytes

dc, 9 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
sequence
integer
or ask your own question.

Linked

Hot Network Questions

New Neighbour Sequence

The Task

25 Answers 25

JavaScript (ES6), 13 bytes

How?

Python 2, 20 bytes

MathGolf, 5 bytes

Explanation:

Jelly, 5 bytes

Wolfram Language (Mathematica), 14 bytes

R, 25 23 21 bytes

dzaima/APL, 9 bytes

Pip, 14 bytes

Common Lisp, 67 bytes

Japt, 8 bytes

05AB1E, 5 bytes

Clean, 31 bytes

Clean, 80 bytes

Pari/GP, 14 bytes

Pari/GP, 14 bytes

J, 30 bytes

Explanation:

J, 9 bytes

K (ngn/k), 12 bytes

Pepe, 65 bytes

x86 machine code, 16 bytes

Red, 26 bytes

Excel, 17 bytes

C (gcc) POSIX, 20 bytes

QBasic, 30 bytes

C# (Visual C# Interactive Compiler), 14 bytes

TI-BASIC, 11 bytes

R, 25 bytes

dc, 9 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfsequenceinteger or ask your own question.

Linked

Related

Hot Network Questions

Not the answer you're looking for? Browse other questions tagged
code-golf
sequence
integer
or ask your own question.