This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324725 a(n) = sign(A324543(n)) * A001511(A324543(n)), with a(n) = 0 if A324543(n) = 0. 4
 0, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 2, 4, 5, 1, -1, 1, 3, 1, 5, 1, 4, 1, 3, 3, 1, 1, 2, 1, 4, 3, 5, 3, 3, 1, 2, 2, 6, 1, -2, 1, 1, 1, 6, 1, 4, 1, -1, 2, 1, 1, 3, 1, 3, 2, 2, 1, 2, 1, 5, 3, 4, 4, 1, 1, 1, 3, -4, 1, 3, 1, 3, 1, 1, 3, -1, 1, 4, 5, 5, 1, 1, 2, 4, 2, 4, 1, 1, 1, 1, 7, 5, 2, 7, 1, -2, 1, 2, 1, 1, 1, 8, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552) FORMULA If A324543(n) = 0, then a(n) = 0, otherwise a(n) = sign(A324543(n)) * A001511(A324543(n)). a(p) = 1 for all primes p. A324828(n) = [1 == abs(a(n))], where [ ] is the Iverson bracket. PROG (PARI) A324543(n) = sumdiv(n, d, moebius(n/d)*A323243(d)); A001511ext(n) = if(!n, n, sign(n)*(1+valuation(n, 2))); \\ Like A001511 but gives 0 for 0 and -A001511(-n) for negative numbers. A324725(n) = A001511ext(A324543(n)); CROSSREFS Cf. A001511, A324343, A324543, A324724, A324817, A324828. Sequence in context: A119805 A111957 A125168 * A328392 A051794 A110969 Adjacent sequences:  A324722 A324723 A324724 * A324726 A324727 A324728 KEYWORD sign AUTHOR Antti Karttunen, Mar 17 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 December 5 20:45 EST 2019. Contains 329779 sequences. (Running on oeis4.)