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.

Showing 1-6 of 6 results.

A065264 Inverse permutation to A065263.

Original entry on oeis.org

2, 4, 1, 8, 10, 5, 3, 16, 18, 20, 22, 11, 6, 9, 7, 32, 34, 36, 38, 40, 42, 44, 46, 23, 12, 21, 13, 19, 14, 17, 15, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 47, 24, 45, 25, 43, 26, 41, 27, 39, 28, 37, 29, 35, 30, 33, 31, 128, 130, 132, 134, 136, 138, 140
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Links

A065265 A065263 conjugated with A059893, inverse of A065266.

Original entry on oeis.org

3, 1, 7, 2, 13, 5, 15, 4, 25, 6, 27, 11, 29, 9, 31, 8, 49, 10, 51, 12, 53, 14, 55, 23, 57, 21, 59, 19, 61, 17, 63, 16, 97, 18, 99, 20, 101, 22, 103, 24, 105, 26, 107, 28, 109, 30, 111, 47, 113, 45, 115, 43, 117, 41, 119, 39, 121, 37, 123, 35, 125, 33, 127, 32, 193, 34, 195
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Links

Formula

a(n) = A059893(A065263(A059893(n)))

A065269 Infinite binary tree inspired permutation of N: 1 -> 1, 11ab..yz -> 11ab..yz0, 10ab..y1 -> 10ab..y, 10ab..y0 -> 11AB..Y1 (where 1AB..Y1 is the complement of 0ab..y0).

Original entry on oeis.org

1, 3, 6, 7, 2, 12, 14, 15, 4, 13, 5, 24, 26, 28, 30, 31, 8, 29, 9, 27, 10, 25, 11, 48, 50, 52, 54, 56, 58, 60, 62, 63, 16, 61, 17, 59, 18, 57, 19, 55, 20, 53, 21, 51, 22, 49, 23, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 127, 32, 125, 33
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Comments

On the right side every node replaces its left child, on the left side the right children replace their parents and the left children are reflected to the right side (becoming right children). See comment at A065263.

Links

Crossrefs

A057114, A065263, A065275, A065281, A065287. Inverse: A065270, conjugated with A059893: A065271 and the inverse of that: A065272.

Programs

  • Maple
    LeftChildInverted := proc(n) local k; if(1 = n) then RETURN(1); fi; k := floor_log_2(n)-1; if(3 = floor(n/(2^k))) then RETURN(2*n); fi; if(1 = (n mod 2)) then RETURN((n-1)/2); fi; RETURN(2^(k+1) + ((2^(k+2))-1) - n); end;

A065275 Infinite binary tree inspired permutation of N: 1 -> 3, 11ab..yz -> 11ab..yz0, 10ab..y0 -> 10ab..y, 10ab..y1 -> 11ab..y1.

Original entry on oeis.org

3, 1, 6, 2, 7, 12, 14, 4, 13, 5, 15, 24, 26, 28, 30, 8, 25, 9, 27, 10, 29, 11, 31, 48, 50, 52, 54, 56, 58, 60, 62, 16, 49, 17, 51, 18, 53, 19, 55, 20, 57, 21, 59, 22, 61, 23, 63, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 32, 97, 33, 99
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Comments

On the right side every node replaces its left child, on the left side the left children replace their parents and the right children are transferred to the same offset at the right side (staying right children). See comment at A065263.

Links

Crossrefs

A057114, A065263, A065269, A065281, A065287. Inverse: A065276, conjugated with A059893: A065277 and the inverse of that: A065278.

Programs

  • Maple
    RightChildTransferred := proc(n) local k; if(1 = n) then RETURN(3); fi; k := floor_log_2(n)-1; if(3 = floor(n/(2^k))) then RETURN(2*n); fi; if(0 = (n mod 2)) then RETURN(n/2); fi; RETURN(n + (2^k)); end;

A065281 Infinite binary tree inspired permutation of N: 1 -> 1, 11ab..yz -> 11ab..yz1, 10ab..y1 -> 10ab..y, 10ab..y0 -> 11ab..y0.

Original entry on oeis.org

1, 3, 7, 6, 2, 13, 15, 12, 4, 14, 5, 25, 27, 29, 31, 24, 8, 26, 9, 28, 10, 30, 11, 49, 51, 53, 55, 57, 59, 61, 63, 48, 16, 50, 17, 52, 18, 54, 19, 56, 20, 58, 21, 60, 22, 62, 23, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 96, 32, 98, 33
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Comments

On the right side every node replaces its right child, on the left side the right children replace their parents and the left children are transferred to the same offset at the right side (staying left children). See comment at A065263.

Links

Crossrefs

A057114, A065263, A065269, A065275, A065287. Inverse: A065282, conjugated with A059893: A065283 and the inverse of that: A065284.

Programs

  • Maple
    LeftChildTransferred := proc(n) local k; if(1 = n) then RETURN(1); fi; k := floor_log_2(n)-1; if(3 = floor(n/(2^k))) then RETURN((2*n)+1); fi; if(1 = (n mod 2)) then RETURN((n-1)/2); fi; RETURN(n + (2^k)); end;

A065287 Infinite binary tree inspired permutation of N: 1 -> 3, 11ab..yz -> 11ab..yz1, 10ab..y0 -> 10ab..y, 10ab..y1 -> 11ab..y0.

Original entry on oeis.org

3, 1, 7, 2, 6, 13, 15, 4, 12, 5, 14, 25, 27, 29, 31, 8, 24, 9, 26, 10, 28, 11, 30, 49, 51, 53, 55, 57, 59, 61, 63, 16, 48, 17, 50, 18, 52, 19, 54, 20, 56, 21, 58, 22, 60, 23, 62, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 32, 96, 33, 98
Offset: 1

Views

Author

Antti Karttunen, Oct 28 2001

Keywords

Comments

On the right side every node replaces its right child, on the left side the left children replace their parents and the right children are transferred to the same offset - 1 at the right side (becoming left children). See comment at A065263.

Links

Crossrefs

A057114, A065263, A065269, A065275, A065281. Inverse: A065288, conjugated with A059893: A065289 and the inverse of that: A065290.

Programs

  • Maple
    RightChildTransferred_1 := proc(n) local k; if(1 = n) then RETURN(3); fi; k := floor_log_2(n)-1; if(3 = floor(n/(2^k))) then RETURN((2*n)+1); fi; if(0 = (n mod 2)) then RETURN(n/2); fi; RETURN(n + (2^k) - 1); end;
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.