[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A290082 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Restricted growth sequence transform of A289625(A003961(n)).
(history; published version)
#6 by N. J. A. Sloane at Sat Jul 22 10:13:16 EDT 2017
STATUS

proposed

approved

#5 by Antti Karttunen at Thu Jul 20 06:37:37 EDT 2017
STATUS

editing

proposed

#4 by Antti Karttunen at Thu Jul 20 06:33:40 EDT 2017
COMMENTS

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

Discussion
Thu Jul 20
06:34
Antti Karttunen: This is also a filtering sequence, thus a longish data-section to ensure enough duplicated terms present.
#3 by Antti Karttunen at Thu Jul 20 06:32:36 EDT 2017
LINKS

Antti Karttunen, <a href="/A290082/b290082.txt">Table of n, a(n) for n = 1..16384</a>

#2 by Antti Karttunen at Thu Jul 20 06:30:52 EDT 2017
NAME

allocated for Antti KarttunenRestricted growth sequence transform of A289625(A003961(n)).

DATA

1, 2, 3, 4, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 11, 14, 7, 15, 16, 17, 15, 11, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 23, 30, 31, 32, 33, 34, 20, 35, 36, 37, 30, 38, 39, 40, 41, 42, 19, 43, 44, 45, 37, 46, 47, 23, 48, 49, 50, 19, 51, 52, 43, 53, 54, 34, 55, 56, 57, 58, 59, 60, 61, 62, 30, 63, 64, 65, 66, 42, 67, 68, 34, 69, 30, 70, 71, 68, 72, 61

OFFSET

1,2

PROG

(PARI)

rgs_transform(invec) = { my(occurrences = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(occurrences, invec[i]), my(pp = mapget(occurrences, invec[i])); outvec[i] = outvec[pp] , mapput(occurrences, invec[i], i); outvec[i] = u; u++ )); outvec; };

write_to_bfile(start_offset, vec, bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ This function from Michel Marcus

A289625(n) = { my(m=1, p=2, v=znstar(n)[2]); for(i=1, length(v), m *= p^v[i]; p = nextprime(p+1)); (m); };

write_to_bfile(1, rgs_transform(vector(16384, n, A289625(A003961(n)))), "b290082_upto16384.txt");

CROSSREFS
KEYWORD

allocated

nonn

AUTHOR

Antti Karttunen, Jul 20 2017

STATUS

approved

editing

#1 by Antti Karttunen at Wed Jul 19 20:13:06 EDT 2017
NAME

allocated for Antti Karttunen

KEYWORD

allocated

STATUS

approved