id:A154403 - OEIS Search Results

Search: id:A154403

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n as a sum a_1 + ... + a_k where a_i >= 2 * a_{i-1} > 1.

+0
1

1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 11, 11, 12, 14, 14, 15, 17, 18, 19, 22, 23, 24, 27, 28, 30, 33, 35, 37, 40, 42, 44, 48, 50, 53, 58, 60, 63, 68, 71, 74, 80, 84, 87, 93, 97, 101, 107, 112, 117, 124, 129, 135, 143, 148, 155, 164, 170, 177, 187, 194 (list; graph; listen)

	OFFSET	`0,7`
	FORMULA	`G.f.: x+(1/(1+x))/Product_{k>0}(1-x^(2^k-1)).`
	CROSSREFS	`Cf. A000929, A154402.` `Sequence in context: A054404 A008671 A025771 this_sequence A053265 A035452 A120187` `Adjacent sequences: A154400 A154401 A154402 this_sequence A154404 A154405 A154406`
	KEYWORD	`easy,nonn`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)eunet.yu), Jan 08 2009`
	EXTENSIONS	`More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 21 2009`

page 1

Search completed in 0.002 seconds

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.

AT&T Labs Research