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.

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