id:A091333 - OEIS Search Results

Search: id:A091333

Displaying 1-1 of 1 results found.

page 1

Number of 1's required to build n using +, -, * and parentheses.

+0
2

1, 2, 3, 4, 5, 5, 6, 6, 6, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 10, 10, 9, 10, 10, 9, 10, 11, 10, 11, 10, 11, 11, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 11, 12, 12, 11, 12, 12, 12, 12, 12, 11, 12, 12, 12, 13, 13, 12, 13, 13, 12, 12, 13, 13, 14, 13, 13, 13, 13, 12, 13, 13, 13, 13, 14 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`A091333(23) = 10 because 23 = (1+1+1+1) * (1+1+1) * (1+1) - 1. (Note that 23 is also the smallest index at which A091333 differs from A005245.)`
	CROSSREFS	`Cf. A005245, A025280, A091334.` `Sequence in context: A025280 A096365 A007600 this_sequence A005245 A061373 A104135` `Adjacent sequences: A091330 A091331 A091332 this_sequence A091334 A091335 A091336`
	KEYWORD	`nonn`
	AUTHOR	`Jens Voss (jens(AT)voss-ahrensburg.de), Dec 30 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research