The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A323241

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A323241

Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n<=2) = -n, f(n) = 0 if n is an odd number > 1, and f(n) = A300226(n) for even numbers >= 4.
(history; published version)

#11 by Susanna Cuyler at Tue Jan 08 19:08:40 EST 2019

STATUS

proposed

approved

#10 by Antti Karttunen at Tue Jan 08 16:07:01 EST 2019

STATUS

editing

proposed

#9 by Antti Karttunen at Tue Jan 08 12:45:57 EST 2019

COMMENTS

a(i) = a(j) >= > A007814(i) = A007814(j).

a(i) = a(j) >= > A183063(i) = A183063(j).

#8 by Antti Karttunen at Tue Jan 08 12:45:27 EST 2019

CROSSREFS

Cf. A007814, A052126, A183063, A300226, A319701, A319988, A323235, A323237, A323238, A323242.

Cf. also A007814, A323235.

#7 by Antti Karttunen at Tue Jan 08 11:30:55 EST 2019

COMMENTS

A319701(i) = A319701(j) => a(i) = a(j) >= A183063(i) = A183063(j).,

a(i) = a(j) >= A007814(i) = A007814(j).

a(i) = a(j) >= A183063(i) = A183063(j).

CROSSREFS

Cf. also A007814, A323235.

#6 by Antti Karttunen at Tue Jan 08 11:29:06 EST 2019

COMMENTS

For all i, j:

A319701(i) = A319701(j) => a(i) = a(j) >= A183063(i) = A183063(j).

CROSSREFS

Cf. A052126, A183063, A300226, A319701, A319988, A323242.

Cf. also A323235.

STATUS

proposed

editing

#5 by Antti Karttunen at Mon Jan 07 15:48:11 EST 2019

STATUS

editing

proposed

#4 by Antti Karttunen at Mon Jan 07 15:10:48 EST 2019

NAME

Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n<=2) = -n, f(n) = 0 if n is an odd number > 1, and f(n) = A300226(n) for all other even numbers >= 4.

#3 by Antti Karttunen at Mon Jan 07 15:03:20 EST 2019

LINKS

Antti Karttunen, <a href="/A323241/b323241.txt">Table of n, a(n) for n = 1..100000</a>

#2 by Antti Karttunen at Mon Jan 07 14:45:51 EST 2019

NAME

allocated Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n<=2) = -n, f(n) = 0 if n is an odd number > 1, and f(n) = A300226(n) for Antti Karttunenall other numbers.

DATA

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

OFFSET

1,2

PROG

(PARI)

up_to = 10000;

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

A052126(n) = if(1==n, n, n/vecmax(factor(n)[, 1]));

A319988(n) = ((n>1)&&(factor(n)[omega(n), 2]>1));

A323241aux(n) = if(n<=2, -n, if(n%2, 0, [A052126(n), A319988(n)]));

v323241 = rgs_transform(vector(up_to, n, A323241aux(n)));

A323241(n) = v323241[n];

CROSSREFS

Cf. A052126, A300226, A319701, A319988, A323242.

KEYWORD

allocated

nonn

AUTHOR

Antti Karttunen, Jan 07 2019

STATUS

approved

editing