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.

A304729 Restricted growth sequence transform of A046523(A303751(n)).

Original entry on oeis.org

1, 2, 3, 2, 4, 5, 6, 5, 4, 7, 2, 3, 8, 3, 7, 4, 9, 4, 10, 11, 12, 13, 12, 14, 11, 12, 13, 12, 10, 15, 16, 5, 4, 7, 4, 9, 6, 17, 6, 9, 18, 2, 3, 8, 3, 7, 4, 9, 4, 7, 19, 3, 8, 20, 8, 19, 7, 18, 7, 21, 12, 13, 22, 13, 23, 15, 16, 15, 10, 21, 4, 7, 19, 7, 18, 9, 24, 9, 25, 10, 26, 11, 12, 13, 12, 10, 15, 16, 15, 10, 21, 12, 13, 22, 13, 21, 10, 25, 10, 27, 28
Offset: 1

Views

Author

Antti Karttunen, May 19 2018

Keywords

Links

Crossrefs

Cf. A046523, A303751.
Cf. also A304728, A304098, A304732.

Programs

  • PARI
    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; };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
v304729 = rgs_transform(vector(76503,n,A046523(A303751(n)))); \\ Needs also code from A303751
A304729(n) = v304729[n];

A304730 Restricted growth sequence transform of A046523(A281978(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 19 2018

Keywords

Links

Crossrefs

Cf. A046523, A281978.
Compare also to the scatter plots of A304098, A304729 and A304732.
Cf. also A304743.

Programs

  • PARI
    up_to = (2^16)+1;
v281978 = vector(1+up_to); v281978[1] = 1;
minverses = Map(); mapput(minverses,1,1);
least_unused_proper_divisor(inverses,n) = { fordiv(n,d,if((dA281978(n) = v281978[n];
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; };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
v304730 = rgs_transform(vector(65535,n,A046523(A281978(n))));
A304730(n) = v304730[n];

A304731 Restricted growth sequence transform of A246277(A304531(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 19 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A246277, A304531.
Differs from related A304728 for the first time at n=66, where a(66) = 18, while A304728(66) = 50.
Cf. also A304535, A304732.

Programs

  • PARI
    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; };
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
A246277(n) = { if(1==n, 0, while((n%2), n = A064989(n)); (n/2)); };
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; };
v304731 = rgs_transform(vector(76503,n,A246277(A304531(n)))); \\ Needs also code from A304531
A304731(n) = v304731[n];

A304757 Restricted growth sequence transform of A046523(A304755(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 21 2018

Keywords

Links

Crossrefs

Cf. A046523, A304755.
Compare also to the scatter plots of A304098, A304729, A304730 and A304732.

Programs

  • PARI
    A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
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; };
v304757 = rgs_transform(vector(up_to,n,A046523(A304755(n)))); \\ Needs also code from A304755
A304757(n) = v304757[n];
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.