[go: up one dir, main page]

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

Showing all changes.
Greatest common divisor of A342002 and its shifted variant, where A342002(n) = A003415(A276086(n)) / A003557(A276086(n)) and A276086 is the primorial base exp-function.
(history; published version)
#9 by N. J. A. Sloane at Fri Apr 29 17:18:41 EDT 2022
STATUS

proposed

approved

#8 by Antti Karttunen at Fri Apr 29 16:48:13 EDT 2022
STATUS

editing

proposed

#7 by Antti Karttunen at Fri Apr 29 16:17:07 EDT 2022
LINKS

Antti Karttunen, <a href="/A353573/b353573.txt">Table of n, a(n) for n = 0..30030</a>

STATUS

approved

editing

#6 by Michael De Vlieger at Fri Apr 29 15:55:57 EDT 2022
STATUS

proposed

approved

#5 by Antti Karttunen at Fri Apr 29 12:47:51 EDT 2022
STATUS

editing

proposed

#4 by Antti Karttunen at Fri Apr 29 12:46:29 EDT 2022
NAME

a(n) = gcd(Greatest common divisor of A342002(n), and its shifted variant, where A342002(A276154n) = A003415(A276086(n)) / A003557(A276086(n)) and A276086 is the primorial base exp-function.

#3 by Antti Karttunen at Fri Apr 29 12:40:10 EDT 2022
FORMULA

For all n >= 1, a(n) = A342002(n) / A353574(n).

#2 by Antti Karttunen at Fri Apr 29 12:35:22 EDT 2022
NAME

allocated for Antti Karttunen

a(n) = gcd(A342002(n), A342002(A276154(n))).

DATA

0, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 1, 2, 1, 1, 1, 8, 1, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1

OFFSET

0,5

LINKS

<a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>

<a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>

FORMULA

a(n) = gcd(A342002(n), A353572(n)).

a(n) = gcd(A353571(A276086(n)), A342001(A276086(n))).

a(n) = A342002(n) / A353574(n).

PROG

(PARI)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));

A003557(n) = (n/factorback(factorint(n)[, 1]));

A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961

A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };

A342001(n) = (A003415(n) / A003557(n));

A353571(n) = A342001(A003961(n));

A353573(n) = gcd(A353571(A276086(n)), A342001(A276086(n)));

KEYWORD

allocated

nonn

AUTHOR

Antti Karttunen, Apr 29 2022

STATUS

approved

editing

#1 by Antti Karttunen at Wed Apr 27 10:29:15 EDT 2022
NAME

allocated for Antti Karttunen

KEYWORD

allocated

STATUS

approved