id:A091334 - OEIS Search Results

Search: id:A091334

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, 5, 5, 6, 7, 7, 8, 8, 7, 6, 7, 7, 8, 8, 9, 9, 9, 8, 7, 7, 6, 7, 8, 9, 8, 7, 8, 9, 8, 7, 8, 9, 10, 10, 11, 11, 12, 11, 10, 11, 10, 9, 8, 9, 10, 9, 9, 8, 9, 9, 10, 10, 11, 11, 10, 9, 8, 7, 8, 9, 10, 11, 11, 10, 10, 9, 10, 10, 10, 11, 11, 10, 9, 8, 7, 8, 9, 10, 11, 12, 11, 12, 12 (list; graph; listen)

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

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research