Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114592
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114592 sum{n>=1} a(n)/n^s = product{k>=2} (1 -1/k^s). +0
2
1, -1, -1, -1, -1, 0, -1, 0, -1, 0, -1, 1, -1, 0, 0, 0 (list; graph; listen)
OFFSET

1,1

COMMENT

For n >= 2, sum{k|n} (A001055(n/k)) *a(k) = 0. A114591(n) = sum{k|n} a(k).

FORMULA

a(1) = 1; for n>= 2, a(n) = sum, over ways to factor n into any number of distinct integers >= 2, of (-1)^(number of integers in a factorization). (See example.)

EXAMPLE

24 can be factored into distinct integers (each >= 2) as 24; as 4*6, 3*8, and 2*12; and as 2*3*4..

So a(24) = (-1)^1 + 3*(-1)^2 + (-1)^3 = 1, where the 1 exponent is due to the 1 factor of the 24 = 24 factorization, and the 2 exponent is due to the 3 cases of 2 factors each of the 24 = 4*6 = 3*8 = 2*12 factorizations, and the 3 exponent is due to the 24 = 2*3*4 factorization.

CROSSREFS

Cf. A001055, A114591.

Sequence in context: A014079 A089497 A089496 this_sequence A140653 A118110 A131522

Adjacent sequences: A114589 A114590 A114591 this_sequence A114593 A114594 A114595

KEYWORD

more,sign

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Dec 11 2005

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research