A319682 -id:A319682 - cp's OEIS frontend

A319681 Restricted growth sequence transform of A319680.

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

Offset: 1

Antti Karttunen, Sep 29 2018

nonn

For all i, j: a(i) = a(j) => A291784(i) = A291784(j).

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A319680, A319682.

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; };
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
A319680(n) = { my(m=1); fordiv(n,d,if((1==moebius(n/d)), m *= A019565(d))); m; };
v319681 = rgs_transform(vector(up_to,n,A319680(n)));
A319681(n) = v319681[n];

A329353 Lexicographically earliest infinite sequence such that a(i) = a(j) => A329352(i) = A329352(j) for all i, j.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Nov 12 2019

nonn

Restricted growth sequence transform of A329352.
For all i, j:
  A305800(i) = A305800(j) => a(i) = a(j),
  a(i) = a(j) => A069359(i) = A069359(j).

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A010051, A019565, A069359, A305800, A329352.
Cf. also A329351.
Differs from A319682 for the first time at n=254, where a(254)=123, while A319682(254)=184.

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; };
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
A329352(n) = { my(m=1); fordiv(n,d,if(isprime(n/d), m *= A019565(d))); (m); };
v329353 = rgs_transform(vector(up_to, n, A329352(n)));
A329353(n) = v329353[n];

A320018 Restricted growth sequence transform of A320017.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Nov 08 2018

nonn

For all i, j: a(i) = a(j) => A318674(i) = A318674(j).

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A320017,

Cf. also A319682.

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; };
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
A320017(n) = if(1==n,n,my(m=1); fordiv(n,d,if(1==moebius(d), m *= A019565(d))); (m));
v320018 = rgs_transform(vector(up_to,n,A320017(n)));
A320018(n) = v320018[n];

cp's OEIS Frontend

A319681 Restricted growth sequence transform of A319680.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A329353 Lexicographically earliest infinite sequence such that a(i) = a(j) => A329352(i) = A329352(j) for all i, j.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A320018 Restricted growth sequence transform of A320017.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI