This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A305795 Restricted growth sequence transform of A305794, a filter sequence constructed from the binary expansions of the divisors of n. 7
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 13, 14, 15, 5, 16, 11, 17, 18, 19, 20, 21, 22, 19, 23, 24, 20, 25, 26, 27, 28, 10, 29, 30, 31, 19, 32, 33, 31, 34, 35, 36, 37, 38, 39, 40, 41, 42, 23, 36, 35, 43, 44, 45, 32, 38, 46, 47, 39, 48, 49, 50, 51, 52, 11, 17, 53, 54, 20, 55, 31, 56, 57, 36, 58, 59, 39, 60, 61, 56, 35, 62, 63, 64, 65, 66, 35, 67 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA For all i, j:   a(i) = a(j) => A000005(i) = A000005(j).   a(i) = a(j) => A007814(i) = A007814(j).   a(i) = a(j) => A093653(i) = A093653(j).   a(i) = a(j) => A154402(i) = A154402(j).   a(i) = a(j) => A305436(i) = A305436(j). PROG (PARI) \\ Needs also code from A286622: 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; }; A305794(n) = { my(m=1); fordiv(n, d, if(d>1, m *= prime(A286622(d)-1))); (m); }; v305795 = rgs_transform(vector(up_to, n, A305794(n))); A305795(n) = v305795[n]; CROSSREFS Cf. A278222, A286622, A305794. Cf. also A304105, A305793, A305815. Sequence in context: A297242 A043272 A278064 * A304232 A303219 A071523 Adjacent sequences:  A305792 A305793 A305794 * A305796 A305797 A305798 KEYWORD nonn AUTHOR Antti Karttunen, Jun 11 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 18:44 EDT 2018. Contains 315210 sequences. (Running on oeis4.)