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.

A060495 Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.

This page as a plain text file.
%I A060495 #7 Nov 25 2022 19:06:42
%S A060495 1,11,312,111,231,222,4413,1313,4112,1111,2411,2312,4242,1241,4233,
%T A060495 1223,2222,2231,3441,3342,3131,3122,3423,3333,55514,14514,51414,11314,
%U A060495 25314,24414,55113,14113,51112,11111,25111,24112,52512,12511,52413
%N A060495 Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.
%C A060495 This sequence is not well-defined for n >= 3628800 because the Site Swap notation can contain values exceeding 9, for example, the Site Swap notation for a(3628800) is [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 10]. - _Sean A. Irvine_, Nov 25 2022
%H A060495 <a href="http://www.juggling.org/bin/mfs/JIS/help/siteswap/">Site Swap notation explained.</a>
%F A060495 a(n) = SiteSwap1ToDec(Perm2SiteSwap1(PermUnrank3R(n))).
%p A060495 Perm2SiteSwap1 := proc(p) local ip,n,i,a; n := nops(p); ip := convert(invperm(convert(p,'disjcyc')),'permlist',n); a := []; for i from 1 to n do a := [op(a),((ip[i]-i) mod n)]; od; RETURN(a); end;
%p A060495 SiteSwap1ToDec := proc(s) local i,z,n; n := nops(s); z := 0; for i from 1 to n do z := 10*z; if(0 = s[i]) then z := z+n; else z := z+s[i]; fi; od; RETURN(z); end;
%Y A060495 Cf. factorial base representation A007623 and A060496, A006694.
%Y A060495 See also A060498, A060499, A061417. Average of digits gives number of balls: A060501.
%K A060495 nonn,base
%O A060495 0,2
%A A060495 Antti Karttunen, Mar 21 2001