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-2 of 2 results.

A338253 Inverse permutation to A338251.

Original entry on oeis.org

0, 1, 2, 3, 5, 4, 9, 8, 6, 7, 10, 11, 13, 12, 18, 19, 21, 20, 17, 16, 14, 15, 34, 35, 37, 36, 33, 32, 30, 31, 25, 24, 22, 23, 26, 27, 29, 28, 41, 40, 38, 39, 42, 43, 45, 44, 50, 51, 53, 52, 49, 48, 46, 47, 73, 72, 70, 71, 74, 75, 77, 76, 82, 83, 85, 84, 81, 80
Offset: 0

Views

Author

Rémy Sigrist, Oct 18 2020

Keywords

Crossrefs

Cf. A338251.

A338252 Nonpositive values in A317050, in order of appearance and negated.

Original entry on oeis.org

0, 1, 2, 4, 3, 5, 6, 10, 9, 7, 8, 16, 15, 17, 18, 14, 13, 11, 12, 20, 19, 21, 22, 26, 25, 23, 24, 40, 39, 41, 42, 38, 37, 35, 36, 28, 27, 29, 30, 34, 33, 31, 32, 64, 63, 65, 66, 62, 61, 59, 60, 68, 67, 69, 70, 74, 73, 71, 72, 56, 55, 57, 58, 54, 53, 51, 52, 44
Offset: 0

Views

Author

Rémy Sigrist, Oct 18 2020

Keywords

Comments

This sequence is a permutation of the nonnegative integers, with inverse A338254 (the offset has been set to 0 so as to have a permutation).

Examples

			A338251 = 0, 1, -1, -2, 2, 3, 5, 4, -4, -3, -5, -6, -10, -9, -7, -8, ...
We keep:  0,     1,  2,              4,  3,  5,  6,  10,  9,  7,  8, ...
		

Crossrefs

Programs

  • PARI
    A317050(n) = fromdigits(binary(bitxor(n, n>>1)), -2)
    print (-select(v -> v<=0, apply(A317050, [0..152])))

Formula

a(n) = -A317050(A053754(n+1)) for any n >= 0.
a(n) = n iff n belongs to A136324.
Showing 1-2 of 2 results.