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

A305296 Restricted growth sequence transform of A305295(n), formed from 1-digits in ternary representation of A245612(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 31 2018

Keywords

Comments

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

Crossrefs

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))));
    A289813(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
    A305295(n) = A289813(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; };
    v305296 = rgs_transform(vector(65538,n,A305295(n-1)));
    A305296(n) = v305296[1+n];

A305432 Restricted growth sequence transform of A278222(A291763(n)), constructed from runlengths of 2-digits in base-3 representation of A245612(n).

Original entry on oeis.org

1, 2, 2, 1, 2, 1, 3, 1, 2, 2, 2, 3, 4, 2, 2, 2, 2, 4, 5, 2, 2, 2, 6, 4, 4, 2, 7, 1, 2, 1, 3, 2, 2, 6, 8, 3, 9, 2, 4, 6, 2, 4, 3, 4, 6, 4, 8, 1, 4, 4, 4, 1, 6, 2, 3, 3, 2, 2, 2, 2, 4, 2, 4, 1, 2, 2, 9, 8, 8, 6, 6, 1, 9, 10, 6, 4, 4, 4, 11, 2, 2, 2, 8, 2, 4, 7, 8, 2, 6, 4, 6, 6, 8, 4, 2, 2, 4, 1, 6, 9, 4, 6, 12, 2, 6, 7
Offset: 0

Views

Author

Antti Karttunen, Jun 01 2018

Keywords

Crossrefs

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));
    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; };
    v305432 = rgs_transform(vector(65538,n,A278222(A291763(n-1))));
    A305432(n) = v305432[1+n];

A305297 Restricted growth sequence transform of A292260, formed from 0-digits in ternary representation of A245612(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 31 2018

Keywords

Comments

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

Crossrefs

Cf. also A305296, A305298.
Cf. also A304750.

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))));
    A291770(n) = { my(s=0, b=1, d); while(n>2, if(!(n%3), s += b); b <<= 1; n \= 3); (s); };
    A292260(n) = A291770(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; };
    v305297 = rgs_transform(vector(65538,n,A292260(n-1)));
    A305297(n) = v305297[1+n];
Showing 1-3 of 3 results.