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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054082 Permutation of N: a(1)=2, a(2)=1 and for each k >= 2, let p(k)=least natural number not already an a(i), q(k)=p(k)+k-1, a(2k-1)=q(k), a(2k)=p(k). 3

%I #10 Apr 01 2020 09:55:56

%S 2,1,4,3,7,5,9,6,12,8,15,10,17,11,20,13,22,14,25,16,28,18,30,19,33,21,

%T 36,23,38,24,41,26,43,27,46,29,49,31,51,32,54,34,56,35,59,37,62,39,64,

%U 40,67,42,70,44,72,45,75,47,77,48,80,50,83

%N Permutation of N: a(1)=2, a(2)=1 and for each k >= 2, let p(k)=least natural number not already an a(i), q(k)=p(k)+k-1, a(2k-1)=q(k), a(2k)=p(k).

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%t a[n_] := If[OddQ[n], Floor[((n+1)/2 - 1) GoldenRatio] + (n+1)/2 + 1, Floor[(n/2 - 1) GoldenRatio] + 2]; a[2] = 1;

%t Array[a, 100] (* _Jean-François Alcover_, Apr 01 2020 *)

%Y Odd-indexed terms: A026356. Even-indexed terms: A026355. Inverse permutation: A064579.

%K nonn,eigen

%O 1,1

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 19:06 EDT 2024. Contains 372388 sequences. (Running on oeis4.)