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.

A304746 Restricted growth sequence transform of A291760(n), formed from 2-digits in ternary representation of A254103(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 29 2018

Keywords

Links

Crossrefs

Cf. A254103, A289814, A291760.
Cf. also A304740, A304748.

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 A289814
A291760(n) = A289814(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; };
v304746 = rgs_transform(vector(65537,n,A291760(n-1)));
A304746(n) = v304746[1+n];

A304758 Restricted growth sequence transform of A304759(n), formed from 1-digits in ternary representation of A048673(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 30 2018

Keywords

Links

Crossrefs

Cf. A048673, A289813, A304759.
Cf. also A304740, 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;
A289813(n) = { my (d=digits(n, 3)); from digits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A304759(n) = A289813(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; };
v304758 = rgs_transform(vector(65537,n,A304759(n)));
A304758(n) = v304758[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];

A340382 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(A291759(i)) = A278222(A291759(j)), for all i, j >= 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jan 16 2021

Keywords

Links

Crossrefs

Cf. A278222, A291759, A304748, A340381,
Cf. A340377 (positions of ones).
Cf. also A305302.

Programs

  • PARI
    up_to = 65537;
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));
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; };
v340382 = rgs_transform(vector(up_to,n,A278222(A291759(n))));
A340382(n) = v340382[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.