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.

A304730 Restricted growth sequence transform of A046523(A281978(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 19 2018

Keywords

Crossrefs

Compare also to the scatter plots of A304098, A304729 and A304732.
Cf. also A304743.

Programs

  • PARI
    up_to = (2^16)+1;
    v281978 = vector(1+up_to); v281978[1] = 1;
    minverses = Map(); mapput(minverses,1,1);
    least_unused_proper_divisor(inverses,n) = { fordiv(n,d,if((dA281978(n) = v281978[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; };
    A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
    v304730 = rgs_transform(vector(65535,n,A046523(A281978(n))));
    A304730(n) = v304730[n];