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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317581 a(1) = 1; a(n > 1) = 1 + Sum_{d|n, d<n} mu(n/d) a(d). 2
1, 0, 0, 1, 0, 2, 0, 0, 1, 2, 0, -2, 0, 2, 2, 1, 0, -2, 0, -2, 2, 2, 0, 4, 1, 2, 0, -2, 0, -6, 0, 0, 2, 2, 2, 7, 0, 2, 2, 4, 0, -6, 0, -2, -2, 2, 0, -4, 1, -2, 2, -2, 0, 4, 2, 4, 2, 2, 0, 16, 0, 2, -2, 1, 2, -6, 0, -2, 2, -6, 0, -12, 0, 2, -2, -2, 2, -6, 0, -4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

If p is prime, a(p^k) = 0 if k is odd, 1 if k is even. - Robert Israel, Aug 01 2018

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

MAPLE

f:= n -> 1 + add(numtheory:-mobius(n/d)*procname(d), d=numtheory:-divisors(n) minus {n}):

f(1):= 1:

map(f, [$1..100]); # Robert Israel, Aug 01 2018

MATHEMATICA

a[n_]:=1+Sum[MoebiusMu[n/d]*a[d], {d, Most[Divisors[n]]}];

Array[a, 100]

CROSSREFS

Cf. A001678, A002033, A007554, A038046, A067824.

Sequence in context: A264405 A304650 A347992 * A035217 A277808 A105964

Adjacent sequences:  A317578 A317579 A317580 * A317582 A317583 A317584

KEYWORD

sign,eigen

AUTHOR

Gus Wiseman, Jul 31 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 21:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)