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.

A360414 Inverse permutation to A360413.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 8, 10, 7, 9, 11, 12, 13, 14, 15, 18, 21, 16, 19, 22, 23, 26, 28, 29, 33, 36, 17, 20, 24, 25, 27, 30, 31, 34, 37, 32, 35, 38, 39, 40, 41, 42, 46, 50, 43, 47, 51, 52, 57, 60, 61, 68, 73, 44, 48, 53, 54, 58, 62, 63, 69, 74, 64, 70, 75, 76, 80
Offset: 0

Views

Author

Rémy Sigrist, Feb 06 2023

Keywords

Examples

			A360413(43) = 45, so a(45) = 43.
		

Crossrefs

Cf. A360413.

A360415 a(n) is the greatest number k not yet in the sequence such that A065361(n) = A065361(k).

Original entry on oeis.org

0, 1, 3, 2, 4, 9, 6, 10, 12, 5, 7, 11, 8, 13, 27, 18, 28, 30, 15, 19, 29, 21, 31, 36, 33, 37, 39, 14, 16, 20, 17, 22, 32, 24, 34, 38, 23, 25, 35, 26, 40, 81, 54, 82, 84, 45, 55, 83, 57, 85, 90, 87, 91, 93, 42, 46, 56, 48, 58, 86, 63, 88, 92, 60, 64, 89, 66, 94
Offset: 0

Views

Author

Rémy Sigrist, Feb 06 2023

Keywords

Comments

This sequence is a self-inverse permutation of the nonnegative integers.

Examples

			There are four numbers k such that A065361(k) = 8: 14, 15, 18, 27,
- so a(14) = 27,
     a(15) = 18,
     a(18) = 15,
     a(27) = 14.
		

Crossrefs

See A360434 for a similar sequence.

Programs

  • PARI
    See Links section.

Formula

a(A360413(n, k)) = A360413(n, A002487(n) + 1 - k).
a(A032924(n)) = A005836(n+1) for any n > 0.
a(A005836(n+1)) = A032924(n) for any n > 0.
Showing 1-2 of 2 results.