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.

A304098 Restricted growth sequence transform of A046523(A282291(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 17 2018

Keywords

Comments

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

Crossrefs

Programs

  • PARI
    \\ Needs also code from A282291:
    write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[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
    write_to_bfile(1,rgs_transform(vector(60824,n,A046523(A282291(n)))),"b304098.txt");