This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058301 Number of solutions to c(0)F(0)+...+c(n)F(n) = 0, where c(i) = +-1 for i>=0, number of (+1)'s >= number of (-1)'s, F(i) = A000045(i) = Fibonacci numbers. 0
 1, 0, 2, 3, 0, 6, 4, 0, 8, 11, 0, 22, 16, 0, 32, 42, 0, 84 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA a(3n+1)=0, a(A047270(n))=A002083(n+5), a(A047238(n))=2^n. EXAMPLE a(3) = 3 because +0+1+1-2 = -0+1+1-2 = +0-1-1+2 = 0.; a(5) = 6 because +0+1-1-2-3+5 = +0-1+1-2-3+5 = +0+1-1+2+3-5 = -0+1-1+2+3-5 = +0-1+1+2+3-5 = -0-1+1+2+3-5 = 0. CROSSREFS Cf. A000045, A002083, A047270, A047238. Sequence in context: A127468 A173720 A173717 * A199601 A097287 A089134 Adjacent sequences:  A058298 A058299 A058300 * A058302 A058303 A058304 KEYWORD nonn AUTHOR Naohiro Nomoto, Dec 08 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .