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.

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