id:A058301 - OEIS Search Results

Search: id:A058301

Displaying 1-1 of 1 results found.

page 1

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

1, 0, 2, 3, 0, 6, 4, 0, 8, 11, 0, 22, 16, 0, 32, 42, 0, 84 (list; graph; listen)

	OFFSET	`0,3`
	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: A122830 A115562 A127468 this_sequence A097287 A089134 A084257` `Adjacent sequences: A058298 A058299 A058300 this_sequence A058302 A058303 A058304`
	KEYWORD	`nonn`
	AUTHOR	`Naohiro Nomoto (6284968128(AT)geocities.co.jp), Dec 08 2000`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research