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

A304740 Restricted growth sequence transform of A304760(n), formed from 1-digits in ternary representation of A254103(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 29 2018

Keywords

Links

Crossrefs

Cf. A254103, A289813, A304760.
Cf. also A304746.

Programs

  • PARI
    A254103(n) = if(!n,n,if(!(n%2),(3*A254103(n/2))-1,(3*(1+A254103((n-1)/2)))\2));
A289813(n) = { my (d=digits(n, 3)); from digits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A304760(n) = A289813(A254103(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; };
v304740 = rgs_transform(vector(65538,n,A304760(n-1)));
A304740(n) = v304740[1+n];

A304748 Restricted growth sequence transform of A291759(n), formed from 2-digits in ternary representation of A048673(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 29 2018

Keywords

Links

Crossrefs

Cf. A048673, A289814, A291759.
Cf. also A304746.

Programs

  • PARI
    A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814
A291759(n) = A289814(A048673(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; };
v304748 = rgs_transform(vector(65537,n,A291759(n)));
A304748(n) = v304748[n];

A305302 Restricted growth sequence transform of A278222(A291760(n)), constructed from runlengths of 2-digits in base-3 representation of A254103(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 2, 4, 1, 3, 1, 2, 2, 5, 2, 2, 2, 4, 1, 4, 1, 2, 2, 4, 1, 2, 2, 2, 2, 4, 2, 6, 1, 3, 3, 2, 2, 5, 1, 4, 1, 3, 2, 4, 2, 5, 2, 2, 2, 6, 2, 4, 3, 7, 2, 2, 2, 4, 3, 2, 4, 8, 2, 4, 2, 4, 3, 6, 1, 2, 4, 4, 2, 6, 1, 2, 2, 4, 3, 6, 1, 2, 2, 4, 1, 2, 2, 4, 2, 4, 1, 4, 2, 4, 3, 6, 2, 4, 1, 2, 2
Offset: 0

Views

Author

Antti Karttunen, May 30 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A254103, A289814, A291760, A304746.
Cf. also A305301, A305303.

Programs

  • PARI
    A254103(n) = if(!n,n,if(!(n%2),(3*A254103(n/2))-1,(3*(1+A254103((n-1)/2)))\2));
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289813
A291760(n) = A289814(A254103(n));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A278222(n) = A046523(A005940(1+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; };
v305302 = rgs_transform(vector(65538,n,A278222(A291760(n-1))));
A305302(n) = v305302[1+n];

A305303 Restricted growth sequence transform of ordered pair [A278222(A304760(n)), A278222(A291760(n))], constructed from runlengths of 1-digits and 2-digits in base-3 representation of A254103(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 30 2018

Keywords

Comments

Restricted growth sequence transform of A290093(A254103(n)).
For all i, j: a(i) = a(j) => A286633(i) = A286633(j) => A286632(i) = A286632(j).

Links

Crossrefs

Cf. A254103, A289813, A289814, A291760, A304740, A304746, A304760.
Cf. also A286632, A286633, A290093, A290094, A305301, A305302.

Programs

  • PARI
    A254103(n) = if(!n,n,if(!(n%2),(3*A254103(n/2))-1,(3*(1+A254103((n-1)/2)))\2));
A289813(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289813
A304760(n) = A289813(A254103(n));
A291760(n) = A289814(A254103(n));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A278222(n) = A046523(A005940(1+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; };
Aux305303(n) = [A278222(A304760(n)), A278222(A291760(n))];
v305303 = rgs_transform(vector(65538,n,Aux305303(n-1)));
A305303(n) = v305303[1+n];

A305298 Restricted growth sequence transform of A291763, formed from 2-digits in ternary representation of A291763(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 31 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A245612, A289814, A291763, A292262, A305432.
Cf. also A305296, A305297.
Cf. also A304746, A304748.

Programs

  • PARI
    A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A254049(n) = A048673((2*n)-1);
A245612(n) = if(n<2,1+n,if(!(n%2),(3*A245612(n/2))-1,A254049(A245612((n-1)/2))));
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814
A291763(n) = A289814(A245612(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; };
v305298 = rgs_transform(vector(65538,n,A291763(n-1)));
A305298(n) = v305298[1+n];

A304750 Restricted growth sequence transform of A292240(n), formed from 0-digits in ternary representation of A254103(n).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 4, 1, 1, 1, 1, 4, 1, 1, 1, 2, 5, 3, 4, 2, 1, 3, 4, 2, 1, 6, 7, 1, 1, 3, 4, 5, 1, 1, 1, 2, 8, 1, 1, 7, 5, 5, 5, 4, 1, 8, 8, 7, 5, 5, 5, 9, 1, 1, 1, 2, 10, 3, 4, 1, 1, 8, 8, 11, 5, 12, 13, 1, 1, 3, 4, 5, 1, 1, 1, 4, 14, 3, 4, 2, 1, 15, 16, 1, 8, 12, 13, 2, 8, 6, 7, 9, 1, 17, 18, 2, 14, 15, 16, 19, 8, 12
Offset: 0

Views

Author

Antti Karttunen, May 30 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A254103, A291770, A292240.
Cf. also A292241, A304740, A304746.

Programs

  • PARI
    A254103(n) = if(!n,n,if(!(n%2),(3*A254103(n/2))-1,(3*(1+A254103((n-1)/2)))\2));
A291770(n) = { my(s=0, b=1, d); while(n>2, if(!(n%3), s += b); b <<= 1; n \= 3); (s); };
A292240(n) = A291770(A254103(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; };
v304750 = rgs_transform(vector(65538,n,A292240(n-1)));
A304750(n) = v304750[1+n];
Showing 1-6 of 6 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.