login
Quintal Queens permutation of N: double (mod 5) each digit (0->0, 1->2, 2->4, 3->1, 4->3) of the base-5 representation of n-1, add one.
5

%I #8 May 01 2014 02:49:08

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

%T 53,55,52,54,61,63,65,62,64,71,73,75,72,74,56,58,60,57,59,66,68,70,67,

%U 69,101,103,105,102,104,111,113,115,112,114,121,123,125,122,124,106

%N Quintal Queens permutation of N: double (mod 5) each digit (0->0, 1->2, 2->4, 3->1, 4->3) of the base-5 representation of n-1, add one.

%C See comment at A065256.

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

%p [seq(QuintalQueens1(j),j=1..125)]; QuintalQueens0 := n -> DoubleDigits(n,5); QuintalQueens1 := n -> 1+QuintalQueens0(n-1);

%p DoubleDigits := proc(n,b) local i; add((b^i)*((2*floor(n/(b^i))) mod b),i=0..floor(evalf(log[b](n+1)))+1); end;

%Y Inverse permutation: A065258. A065257[n] = A004515[n-1]+1. Cf. also A065186, A065188.

%K nonn,base

%O 1,2

%A _Antti Karttunen_, Oct 26 2001