Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163577
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163577 Count of indices x in [0,n] which solve the equation A000120(x)+A000120(n-x)=A000120(n)+2. +0
1
0, 0, 0, 0, 2, 0, 1, 0, 2, 4, 1, 0, 5, 2, 2, 0, 2, 4, 5, 8, 5, 2, 4, 0, 5, 10, 4, 4, 10, 4, 4, 0, 2, 4, 5, 8, 9, 10, 12, 16, 5, 10, 6, 4, 12, 8, 8, 0, 5, 10, 12, 20, 12, 8, 12, 8, 10, 20, 8, 8, 20, 8, 8, 0, 2, 4, 5, 8, 9, 10, 12, 16, 9, 18, 14, 20, 20, 24, 24, 32, 5, 10, 14, 20, 14, 12, 16, 8, 12, 24 (list; graph; listen)
OFFSET

0,5

COMMENT

For every solution x, binomial(n,x) is 4 times an odd integer.

LINKS

V. Shevelev, Binomial predictors, arXiv:0907.3302

EXAMPLE

For n=8, there are a(8)=2 solutions, namely x=2 and x=6.

For n=9, there are a(9)=4 solutions, namely x=2, 3, 6 and 7.

MAPLE

read("transforms") ; A000120 := proc(n) wt(n) ; end:

A163577 := proc(n) local a, x ; a := 0 ; for x from 0 to n do if A000120(x)+A000120(n-x) = A000120(n)+2 then a := a+1; fi; od: a; end:

seq(A163577(n), n=0..130) ; # R. J. Mathar, Jul 08 2009

CROSSREFS

Cf. A000120, A163000 ,A007814

Sequence in context: A104597 A072662 A030010 this_sequence A132178 A039655 A103775

Adjacent sequences: A163574 A163575 A163576 this_sequence A163578 A163579 A163580

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Jul 31 2009

EXTENSIONS

Extended beyond a(22), examples added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 08 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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research