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

A366283 a(n) = gcd(n, A366275(n)), where A366275 is the Cat's tongue permutation.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Oct 07 2023

Keywords

Crossrefs

Differs from related A364255 for the first time at n=25, where a(25) = 25, while A364255(25) = 5.

Programs

Formula

a(n) = gcd(n,A366282(n)) = gcd(A366275(n),A366282(n)).
a(n) = n / A366284(n) = A366275(n) / A366285(n).

A366376 Lexicographically earliest infinite sequence such that a(i) = a(j) => A366375(i) = A366375(j) for all i, j >= 0, where A366375(n) is the denominator of n / A332214(n).

Original entry on oeis.org

1, 2, 2, 1, 2, 3, 1, 1, 2, 4, 3, 5, 1, 6, 1, 1, 2, 7, 4, 8, 3, 9, 5, 10, 1, 11, 6, 12, 1, 13, 1, 1, 2, 7, 7, 8, 4, 14, 8, 15, 3, 16, 9, 17, 5, 18, 10, 19, 1, 20, 11, 21, 6, 22, 12, 23, 1, 13, 13, 24, 1, 25, 1, 26, 2, 27, 7, 28, 7, 29, 8, 30, 4, 31, 14, 12, 8, 32, 15, 33, 3, 5, 16, 34, 9, 22, 17, 35, 5, 36, 18, 19, 10
Offset: 0

Views

Author

Antti Karttunen, Oct 08 2023

Keywords

Comments

Restricted growth sequence transform of A366375.

Crossrefs

Cf. also A365393, A365431, A366286 (compare the scatter plots).

Programs

  • PARI
    \\ Needs also program from A332214:
    up_to = 65537;
    rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
    A366375(n) = { my(u=A332214(n)); (u/gcd(n,u)); };
    v366376 = rgs_transform(vector(1+up_to,n,A366375(n-1)));
    A366376(n) = v366376[1+n];

A366285 a(n) = A366275(n) / gcd(n, A366275(n)), where A366275 is the Cat's tongue permutation.

Original entry on oeis.org

1, 2, 2, 1, 2, 9, 1, 5, 2, 3, 9, 15, 1, 25, 5, 7, 2, 81, 3, 45, 9, 25, 15, 21, 1, 5, 25, 35, 5, 49, 7, 11, 2, 81, 81, 27, 3, 225, 45, 21, 9, 375, 25, 105, 15, 49, 21, 33, 1, 625, 5, 175, 25, 245, 35, 1, 5, 343, 49, 77, 7, 121, 11, 13, 2, 729, 81, 405, 81, 225, 27, 189, 3, 1125, 225, 21, 45, 63, 21, 99, 9, 625, 375, 525
Offset: 0

Views

Author

Antti Karttunen, Oct 07 2023

Keywords

Comments

Denominator of n / A366275(n).

Crossrefs

Cf. A057889, A163511, A366275, A366282, A366283, A366284 (numerators), A366286 (rgs-transform).
Cf. also A364492.

Programs

Formula

a(n) = A366275(n) / A366283(n) = A366275(n) / gcd(n, A366275(n))

A366284 a(n) = n / gcd(n, A366275(n)), where A366275 is the Cat's tongue permutation.

Original entry on oeis.org

0, 1, 1, 1, 1, 5, 1, 7, 1, 1, 5, 11, 1, 13, 7, 15, 1, 17, 1, 19, 5, 7, 11, 23, 1, 1, 13, 27, 7, 29, 15, 31, 1, 11, 17, 7, 1, 37, 19, 13, 5, 41, 7, 43, 11, 15, 23, 47, 1, 49, 1, 51, 13, 53, 27, 1, 7, 57, 29, 59, 15, 61, 31, 63, 1, 65, 11, 67, 17, 23, 7, 71, 1, 73, 37, 5, 19, 11, 13, 79, 5, 27, 41, 83, 7, 17, 43, 29, 11
Offset: 0

Views

Author

Antti Karttunen, Oct 07 2023

Keywords

Comments

Numerator of n / A366275(n).

Crossrefs

Cf. also A364491.

Programs

Formula

a(n) = n / A366283(n) = n / gcd(n, A366275(n))
Showing 1-4 of 4 results.