|
|
A347758
|
|
Let s(k) be the finite permutation associated to A109299(k); s(a(n)) is the inverse of s(n).
|
|
3
|
|
|
1, 2, 3, 4, 5, 7, 6, 8, 9, 10, 11, 13, 12, 14, 15, 19, 18, 17, 16, 21, 20, 23, 22, 24, 25, 28, 29, 26, 27, 30, 31, 32, 33, 34, 35, 39, 38, 37, 36, 42, 41, 40, 46, 44, 48, 43, 47, 45, 53, 54, 55, 52, 49, 50, 51, 58, 61, 56, 60, 59, 57, 63, 62, 65, 64, 66, 68
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence is a self-inverse permutation of the positive integers.
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 42:
- A109299(42) = 2^5 * 3^3 * 5^4 * 7^1 * 11^2,
- so s(42) = [5, 3, 4, 1, 2],
- and s(a(42)) = [4, 5, 2, 3, 1],
- hence a(42) = 40.
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|