The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328382 a(n) = A276086(n) mod A003415(n). 4
 0, 0, 1, 0, 0, 0, 3, 0, 3, 0, 9, 0, 3, 6, 1, 0, 20, 0, 15, 0, 7, 0, 9, 0, 0, 24, 25, 0, 7, 0, 21, 0, 6, 6, 35, 0, 0, 2, 43, 0, 11, 0, 45, 36, 0, 0, 91, 0, 15, 10, 35, 0, 1, 14, 61, 4, 5, 0, 49, 0, 15, 39, 57, 0, 1, 0, 15, 14, 22, 0, 133, 0, 9, 35, 65, 0, 19, 0, 71, 30, 42, 0, 121, 2, 30, 6, 105, 0, 97, 6, 69, 18, 0, 6, 83, 0, 63, 15, 35, 0, 21 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,7 LINKS Antti Karttunen, Table of n, a(n) for n = 2..30030 FORMULA a(n) = A276086(n) mod A003415(n). For n >= 2, gcd(a(n), A003415(n)) = A327858(n). PROG (PARI) A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1])); A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; A328382(n) = (A276086(n)%A003415(n)); CROSSREFS Cf. A003415, A276086, A327858, A328386. Sequence in context: A022901 A055945 A138123 * A211868 A127372 A051171 Adjacent sequences:  A328378 A328379 A328381 * A328383 A328384 A328385 KEYWORD nonn AUTHOR Antti Karttunen, Oct 15 2019 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 07:07 EST 2020. Contains 331168 sequences. (Running on oeis4.)