Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117997
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117997 Sum_{d|n} a(d) = n for n=3^m (m>=0) and for other n the sum is zero; i.e., the Moebius transform of [1,0,3,0,0,0,0,0,9,0,...]. +0
1
1, -1, 2, 0, -1, -2, -1, 0, 6, 1, -1, 0, -1, 1, -2, 0, -1, -6, -1, 0, -2, 1, -1, 0, 0, 1, 18, 0, -1, 2, -1, 0, -2, 1, 1, 0, -1, 1, -2, 0, -1, 2, -1, 0, -6, 1, -1, 0, 0, 0, -2, 0, -1, -18, 1, 0, -2, 1, -1, 0, -1, 1, -6, 0, 1, 2, -1, 0, -2, -1, -1, 0, -1, 1, 0, 0, 1, 2, -1, 0, 54, 1, -1, 0, 1, 1, -2, 0, -1, 6, 1, 0, -2, 1, 1, 0, -1, 0, -6, 0, -1, 2, -1, 0, 2 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: x = Sum_{n>=1} a(n)/n*log(1 + x^n + x^(2n)).

PROGRAM

(PARI) {a(n)=if(n==1, 1, -n*polcoeff(x+sum(k=1, n-1, a(k)/k*subst(log(1+x+x^2+x*O(x^n)), x, x^k+x*O(x^n))), n))}

CROSSREFS

Sequence in context: A036586 A092928 A085097 this_sequence A079684 A033761 A033805

Adjacent sequences: A117994 A117995 A117996 this_sequence A117998 A117999 A118000

KEYWORD

sign

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 08 2006

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