Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087810 First differences of A029931. +0
1
1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0, 1, 1, 1, -5, 1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0, 1, 1, 1, -9, 1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0, 1, 1, 1, -5, 1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0, 1, 1, 1, -14, 1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0, 1, 1, 1, -5, 1, 1, 1, 0, 1, 1, 1, -2, 1, 1, 1, 0 (list; graph; listen)
OFFSET

1,8

COMMENT

Multiplicative with a(2^e) = 1-A000217(e-1), a(p^e) = 1 otherwise. Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu) May 17, 2005.

FORMULA

a(4n) = 1 - T(v_2(n)), else a(n) = 1, where T = A000217 (triangular numbers) and v_2 = A007814 (exponent of 2 in factorization of n).

G.f.: sum(k>=0, (k+1)t/(1+t), t=x^2^k).

PROGRAM

(PARI) a(n)=if(n<1, 0, if(n%2==0, if(n%4, 1, 1-valuation(n, 2)*(valuation(n, 2)-1)/2), 1))

(PARI) a(n)=polcoeff(sum(k=0, floor(log2(n)), (k+1)*x^2^k/(1+x^2^k)), n)

CROSSREFS

Sequence in context: A117195 A107034 A117410 this_sequence A052314 A093718 A035212

Adjacent sequences: A087807 A087808 A087809 this_sequence A087811 A087812 A087813

KEYWORD

sign,easy,mult

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 16 2003

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research