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!)
A320110 Restricted growth sequence transform of function f: f(1) = 0, f(n) = A046523(A252463(n)) for n > 1. 3
1, 2, 3, 3, 3, 3, 3, 4, 4, 3, 3, 5, 3, 3, 5, 6, 3, 4, 3, 5, 5, 3, 3, 7, 4, 3, 6, 5, 3, 5, 3, 8, 5, 3, 5, 7, 3, 3, 5, 7, 3, 5, 3, 5, 7, 3, 3, 9, 4, 4, 5, 5, 3, 6, 5, 7, 5, 3, 3, 10, 3, 3, 7, 11, 5, 5, 3, 5, 5, 5, 3, 12, 3, 3, 7, 5, 5, 5, 3, 9, 8, 3, 3, 10, 5, 3, 5, 7, 3, 7, 5, 5, 5, 3, 5, 13, 3, 4, 7, 7, 3, 5, 3, 7, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

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

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

A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523

A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};

A252463(n) = if(!(n%2), n/2, A064989(n));

A320110aux(n) = if(1==n, 0, A046523(A252463(n)));

v320110 = rgs_transform(vector(up_to, n, A320110aux(n)));

A320110(n) = v320110[n];

CROSSREFS

Cf. A046523, A252463, A320111.

Sequence in context: A025784 A035390 A092938 * A068953 A189635 A109785

Adjacent sequences:  A320107 A320108 A320109 * A320111 A320112 A320113

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 22 2018

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 April 7 01:00 EDT 2020. Contains 333291 sequences. (Running on oeis4.)