cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A084461 Permutation of Z, obtained by reflecting the juggling sequence A084458 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.

This page as a plain text file.
%I A084461 #9 Jul 29 2017 13:10:48
%S A084461 1,10,2,12,4,18,6,8,9,20,3,28,5,14,15,16,17,24,7,34,11,22,23,38,19,26,
%T A084461 27,46,13,30,31,32,33,48,21,36,37,58,25,40,41,42,43,44,45,60,29,72,35,
%U A084461 50,51,52,53,54,55,56,57,66,39,80,47,62,63,64,65,84,59,68,69,70,71,94
%N A084461 Permutation of Z, obtained by reflecting the juggling sequence A084458 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
%C A084461 This permutation consists of three infinite cycles + infinite number of fixed points.
%H A084461 A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a>
%H A084461 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%p A084461 [seq(Z2N(A084461_Z2Z(N2Z(n))),n=1..45)];
%p A084461 N2Z := n -> ((-1)^n)*floor(n/2);
%p A084461 Z2N := z -> 2*abs(z)+`if`((z < 1),1,0);
%p A084461 A084461_Z2Z := z -> z+`if`((z > 0), A084458(z),`if`((z >= -3),2*(-z), A084458(A084460((-z)-3))));
%Y A084461 Inverse: A084462. Cf. also A084460, A084455, A084491, A084495, A084499, A065166.
%K A084461 nonn
%O A084461 1,2
%A A084461 _Antti Karttunen_, Jun 02 2003