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.

Previous Showing 21-30 of 112 results. Next

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];

A305433 Restricted growth sequence transform of ordered pair [A278222(A305295(n)), A278222(A291763(n))], constructed from runlengths of 1-digits and 2-digits in base-3 representation of A245612(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 01 2018

Keywords

Comments

Restricted growth sequence transform of A290093(A245612(n)).

Links

Crossrefs

Cf. A245612, A278222, A290093, A290094, A291763, A305295, A305431, A305432, A305434.
Cf. also A305303.

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

A331745 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(i) = A278222(j) and A323901(i) = A323901(j) for all i, j.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 04 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A278222(n), A323901(n)].

Links

Crossrefs

Cf. A278222, A323901.
Cf. also A324400, A286622, A318310, A324389, A331744, A331746.

Programs

  • PARI
    \\ Needs also code from A323901.
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; };
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));
Aux331745(n) = [A278222(n),A323901(n)];
v331745 = rgs_transform(vector(1+up_to, n, Aux331745(n-1)));
A331745(n) = v331745[1+n];

Formula

a(2^n) = 2 for all n >= 0.

A331747 Lexicographically earliest infinite sequence such that a(i) = a(j) => A009194(i) = A009194(j) and A278222(i) = A278222(j) for all i, j.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 04 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A009194(n), A278222(n)].
For all i, j:
A331746(i) = A331746(j) => a(i) = a(j).

Links

Crossrefs

Cf. A009194, A278222.
Cf. also A324400, A286622, A318310, A318311, A324389, A331744, A331745, A331746.

Programs

  • PARI
    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; };
A009194(n) = gcd(n, sigma(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));
Aux331747(n) = [A009194(n),A278222(n)];
v331747 = rgs_transform(vector(up_to, n, Aux331747(n)));
A331747(n) = v331747[n];

Formula

a(2^n) = 1 for all n >= 0.

A336162 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(i) = A278222(j) and A335915(i) = A335915(j), for all i, j >= 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 11 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A278222(n), A335915(n)].
For all i, j: A324400(i) = A324400(j) => a(i) = a(j).

Links

Crossrefs

Cf. A000265, A005940, A046523, A278222, A335915.
Cf. also A286622, A324400, A336155, A336159, A336160.

Programs

  • PARI
    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; };
A000265(n) = (n>>valuation(n,2));
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));
A335915(n) = { my(f=factor(n)); prod(k=1,#f~,if(2==f[k,1],1,(A000265(f[k,1]-1)*A000265(f[k,1]+1))^f[k,2])); };
Aux336162(n) = [A278222(n), A335915(n)];
v336162 = rgs_transform(vector(up_to, n, Aux336162(n)));
A336162(n) = v336162[n];

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

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 1, 3, 1, 4, 1, 2, 2, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 2, 3, 1, 2, 1, 2, 1, 2, 1, 4, 2, 3, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 4, 1, 2, 1, 2, 2, 2, 1, 3, 1, 4, 1, 2, 1, 2, 2, 4, 1, 3, 1, 3, 1, 3, 1, 3, 2
Offset: 1

Views

Author

Antti Karttunen, Jul 17 2020

Keywords

Comments

Restricted growth sequence transform of A278222(A336120(n)).
For all i, j:
a(i) = a(j) => A336121(i) = A336121(j) => A335909(i) = A335909(j).

Links

Crossrefs

Cf. A336311, A336313.
Cf. A336119 (positions of ones).
Cf. also A292583, A332901, A335909, A336121.

Programs

  • PARI
    up_to = 1024; \\ 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; };
\\ Needs also code from A336124:
A253553(n) = if(n<=2,1,my(f=factor(n), k=#f~); if(f[k,2]>1,f[k,2]--,f[k,1] = precprime(f[k,1]-1)); factorback(f));
A336120(n) = if(1==n,0,(3==A336124(n))+(2*A336120(A253553(n))));
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
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));
v336312 = rgs_transform(vector(up_to,n,A278222(A336120(n))));
A336312(n) = v336312[n];

A336472 Lexicographically earliest infinite sequence such that a(i) = a(j) => A278222(i) = A278222(j) and A336466(i) = A336466(j), for all i, j >= 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 24 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A278222(n), A336466(n)].
For all i, j: A336460(i) = A336460(j) => a(i) = a(j).

Links

Crossrefs

Cf. A278222, A336466.
Cf. also A336162, A336460, A336470, A336471, A336473.

Programs

  • PARI
    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; };
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));
A000265(n) = (n>>valuation(n,2));
A336466(n) = { my(f=factor(n)); prod(k=1,#f~,if(2==f[k,1],1,(A000265(f[k,1]-1))^f[k,2])); };
Aux336472(n) = [A278222(n), A336466(n)];
v336472 = rgs_transform(vector(up_to, n, Aux336472(n)));
A336472(n) = v336472[n];

A336935 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007733(i) = A007733(j) and A278222(i) = A278222(j), for all i, j >= 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Aug 10 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A007733(n), A278222(n)].
For all i, j: A324400(i) = A324400(j) => A003602(i) = A003602(j) => a(i) = a(j).

Links

Crossrefs

Cf. A000265, A003602, A007733, A278222, A286622, A324400, A336933, A336934.

Programs

  • PARI
    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; };
A007733(n) = znorder(Mod(2, n/2^valuation(n, 2))); \\ From A007733
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));
Aux336935(n) = [A007733(n), A278222(n)];
v336935 = rgs_transform(vector(up_to, n, Aux336935(n)));
A336935(n) = v336935[n];

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jan 16 2021

Keywords

Comments

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

Links

Crossrefs

Cf. A278222, A304758, A304759, A340378, A340382, A340383.
Cf. A340376 (positions of 2's).
Cf. also A305301.

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;
A289813(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
A304759(n) = A289813(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; };
v340381 = rgs_transform(vector(up_to,n,A278222(A304759(n))));
A340381(n) = v340381[n];
Previous Showing 21-30 of 112 results. Next

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

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