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.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 04 2020

Keywords

Comments

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

Links

Crossrefs

Cf. A002487, A009194, A163511, A323901.
Cf. also A324400, A318310, A324389, A331745, A331746, A331747.

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; };
A009194(n) = gcd(n, sigma(n));
Aux331744(n) = [A009194(n),A323901(n)];
v331744 = rgs_transform(vector(up_to, n, Aux331744(n)));
A331744(n) = v331744[n];

Formula

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

A324389 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A009194(n), A318458(n)] for all other numbers, except f(1) = -1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Mar 05 2019

Keywords

Comments

For all i, j:
A324401(i) = A324401(j) => a(i) = a(j).
Regarding the scatter plot of this sequence, see also comments in A318310. - Antti Karttunen, Feb 04 2020

Links

Crossrefs

Cf. A009194, A318310, A318458, A324390, A324401, A324530, A331744, A331746, A331747.

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));
A318458(n) = bitand(n,sigma(n)-n);
Aux324389(n) = if(1==n,-1,[A009194(n), A318458(n)]);
v324389 = rgs_transform(vector(up_to,n,Aux324389(n)));
A324389(n) = v324389[n];

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 04 2020

Keywords

Comments

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

Links

Crossrefs

Cf. A009194, A331166, A331300.
Cf. also A331744, A331747.

Programs

  • PARI
    \\ Needs also code from A331166.
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));
Aux331746(n) = [A009194(n),A331166(n)];
v331746 = rgs_transform(vector(up_to, n, Aux331746(n)));
A331746(n) = v331746[n];

A336153 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(1+i) = A007814(1+j) and A009194(i) = A009194(j), for all i, j >= 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 11 2020

Keywords

Comments

Restricted growth sequence transform of the ordered pair [A007814(1+n), A009194(n)]. Note that A007814(1+n) gives the number of trailing 1-bits in the binary expansion of n.
For all i, j: A324400(i) = A324400(j) => a(i) = a(j).

Links

Crossrefs

Cf. A007814, A009194.
Cf. also A324400, A331747, A336154, A336155, A336156.

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; };
A007814(n) = valuation(n,2);
A009194(n) = gcd(n, sigma(n));
Aux336153(n) = [A007814(1+n), A009194(n)];
v336153 = rgs_transform(vector(up_to, n, Aux336153(n)));
A336153(n) = v336153[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.