login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325383 Lexicographically earliest sequence such that a(i) = a(j) => A000203(i) = A000203(j) and A009194(i) = A009194(j) for all i, j. 3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 16, 20, 25, 26, 27, 28, 21, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 32, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 51, 67, 68, 69, 70, 71, 72, 73, 53, 74, 75, 64, 61, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences related to sigma(n)

PROG

(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));

v325383 = rgs_transform(vector(up_to, n, [sigma(n), A009194(n)]));

A325383(n) = v325383[n];

CROSSREFS

Cf. A000203, A009194, A295300, A325381, A325384.

Sequence in context: A036218 A172275 A025484 * A236851 A030545 A295886

Adjacent sequences:  A325380 A325381 A325382 * A325384 A325385 A325386

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 08 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 20:52 EST 2020. Contains 332258 sequences. (Running on oeis4.)