[go: up one dir, main page]

login
A366283
a(n) = gcd(n, A366275(n)), where A366275 is the Cat's tongue permutation.
9
1, 1, 2, 3, 4, 1, 6, 1, 8, 9, 2, 1, 12, 1, 2, 1, 16, 1, 18, 1, 4, 3, 2, 1, 24, 25, 2, 1, 4, 1, 2, 1, 32, 3, 2, 5, 36, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 48, 1, 50, 1, 4, 1, 2, 55, 8, 1, 2, 1, 4, 1, 2, 1, 64, 1, 6, 1, 4, 3, 10, 1, 72, 1, 2, 15, 4, 7, 6, 1, 16, 3, 2, 1, 12, 5, 2, 3, 8, 1, 6, 7, 4, 3, 2, 1, 96, 1, 2, 1, 100
OFFSET
0,3
FORMULA
a(n) = gcd(n,A366282(n)) = gcd(A366275(n),A366282(n)).
a(n) = n / A366284(n) = A366275(n) / A366285(n).
PROG
(PARI) A366283(n) = gcd(n, A366275(n)); \\ Uses the program given in A366275.
CROSSREFS
Differs from related A364255 for the first time at n=25, where a(25) = 25, while A364255(25) = 5.
Sequence in context: A239223 A143771 A364255 * A065331 A066262 A195989
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 07 2023
STATUS
approved