Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157657
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157657 a(1) = 1, a(n) = (-1)*mu(n) for n >= 2. +0
2
1, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0 (list; graph; listen)
OFFSET

1,1

COMMENT

a(1) = 1, a(n) = (-1)*A008683(n) for n >= 2. a(1) = 1, a(n)=(-1)^(k + 1) if n is the product of k distinct primes, otherwise a(n)=0. Sum_{d|n} a(d) = 1 if n = 1 else 2. a(1) = 1, a(p) = 1, a(pq) = -1, a(pq...z) = (-1)^(k + 1), a(p^k) = 0, for k = natural numbers (A000027)(n) for n > 2, p = primes (A000040), pq = product of two distinct primes (A006881), pq...z = product of k (k > 2) distinct primes p, q, ..., z (A120944), p^k = prime powers (A000961(n) for n > 1). Examples of Dirichlet convolutions with function a(n), i.e. b(n) = Sum_{d|n} a(d)*c(n/d): a(n) * A000012(n) = A130130(n), a(n) * A000027(n) = A053158(n).

CROSSREFS

Cf. A000040, A006881, A120944, A000961, A000027, A130130, A053158

Sequence in context: A145362 A075437 A130047 this_sequence A008683 A008966 A080323

Adjacent sequences: A157654 A157655 A157656 this_sequence A157658 A157659 A157660

KEYWORD

sign

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Mar 03 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research