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.

A065257 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.

Original entry on oeis.org

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, 53, 55, 52, 54, 61, 63, 65, 62, 64, 71, 73, 75, 72, 74, 56, 58, 60, 57, 59, 66, 68, 70, 67, 69, 101, 103, 105, 102, 104, 111, 113, 115, 112, 114, 121, 123, 125, 122, 124, 106
Offset: 1

Views

Author

Antti Karttunen, Oct 26 2001

Keywords

Comments

See comment at A065256.

Crossrefs

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

Programs

  • Maple
    [seq(QuintalQueens1(j),j=1..125)]; QuintalQueens0 := n -> DoubleDigits(n,5); QuintalQueens1 := n -> 1+QuintalQueens0(n-1);
    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;