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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A131802 Sequence related to factorizations and prime signatures: a(1) = 1; for n>1, a(n) = A057567(n) - 2*A001055(n). 4
 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 3, 0, 1, 1, 2, 0, 3, 0, 3, 1, 1, 0, 7, 0, 1, 1, 3, 0, 5, 0, 5, 1, 1, 1, 8, 0, 1, 1, 7, 0, 5, 0, 3, 3, 1, 0, 14, 0, 3, 1, 3, 0, 7, 1, 7, 1, 1, 0, 14, 0, 1, 3, 8, 1, 5, 0, 3, 1, 5, 0, 20, 0, 1, 3, 3, 1, 5, 0, 14, 2, 1, 0, 14, 1, 1, 1, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 EXAMPLE A001055(12) = 4 and A057567(12) = 11 so a(12) = 11 - 2*4 = 3 PROG (PARI) fcnt(n, m) = {local(s); s=0; if(n == 1, s=1, fordiv(n, d, if(d > 1 & d <= m, s=s+fcnt(n/d, d)))); s} A001055(n) = fcnt(n, n) \\ This function from Michael B. Porter, Oct 29 2009 A057567(n) = sumdiv(n, d, A001055(d)); A131802(n) = if(1==n, n, A057567(n) - 2*A001055(n)); \\ Antti Karttunen, May 25 2017 CROSSREFS Cf. A001055, A025487, A057567, A077569, A108464, A122819. Sequence in context: A059341 A249442 A334739 * A069023 A275336 A091614 Adjacent sequences:  A131799 A131800 A131801 * A131803 A131804 A131805 KEYWORD easy,nonn AUTHOR Alford Arnold, Jul 18 2007 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 May 7 15:02 EDT 2021. Contains 343650 sequences. (Running on oeis4.)