id:A076258 - OEIS Search Results

Search: id:A076258

Displaying 1-1 of 1 results found.

page 1

a(n) = 2*sum(k=1,n, A076213(k)) - n.

+0
1

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

	OFFSET	`1,2`
	FORMULA	`It seems that a(n)>0, a(n)/ln(n) is bounded and sum(k=1, n, a(k)) is asymptotic to cnln(n) 1<c<1.5`
	CROSSREFS	`Cf. A005132.` `Sequence in context: A119671 A033787 A030307 this_sequence A030330 A059261 A134967` `Adjacent sequences: A076255 A076256 A076257 this_sequence A076259 A076260 A076261`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 05 2002`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research