id:A025280 - OEIS Search Results

Search: id:A025280

Displaying 1-1 of 1 results found.

page 1

Complexity of n: number of 1's required to build n using +, * and ^.

+0
11

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

	OFFSET	`1,2`
	REFERENCES	`R. K. Guy, Some suspiciously simple sequences, Amer. Math. Monthly 93 (1986), 186-190; 94 (1987), 965; 96 (1989), 905.` `R. K. Guy, Unsolved Problems Number Theory, Sect. F26.`
	CROSSREFS	`Cf. A003037, A005245, A005520.` `A005208(n) + 1.` `Sequence in context: A007599 A133344 A091334 this_sequence A096365 A007600 A091333` `Adjacent sequences: A025277 A025278 A025279 this_sequence A025281 A025282 A025283`
	KEYWORD	`nonn`
	AUTHOR	`njas, David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.

AT&T Labs Research