id:A129972 - OEIS Search Results

Search: id:A129972

Displaying 1-1 of 1 results found.

page 1

a(n)=sum(k=1,n,(-1)^(k-1)*floor(n/k)*mu(k)).

+0
2

1, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Consists of the n-th odd number (A005408(n) = 2n+1) repeated 2^(n-1) times (since a(n)=a(n-1) except when a(n)>a(n-1) which happens for n a power of 2). - Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 17 2007`
	FORMULA	`a(n)=2*floor(log(n)/log(2))+1`
	PROGRAM	`(PARI) a(n)=2*floor(log(n)/log(2))+1`
	CROSSREFS	`Cf. A005408.` `Sequence in context: A071182 A136027 A133772 this_sequence A130829 A035158 A123313` `Adjacent sequences: A129969 A129970 A129971 this_sequence A129973 A129974 A129975`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 13 2007`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research