id:A091960 - OEIS Search Results

Search: id:A091960

Displaying 1-1 of 1 results found.

page 1

A091960

a(1)=1, a(2n)=a(2n-1)+(a(n)mod 2), a(2n+1)=a(2n)+1.

+0
1

1, 2, 3, 3, 4, 5, 6, 7, 8, 8, 9, 10, 11, 11, 12, 13, 14, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 22, 23, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 34, 35, 35, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42, 43, 44, 45, 46, 47, 47, 48, 49, 50, 50, 51, 51, 52, 53, 54, 55, 56 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(4n)=3n iff b(2n)=0 where b(1)=1, b(2n)=(b(2n-1)+b(n)) mod 2, b(2n+1)=b(2n)+1`
	FORMULA	`a(n) is asymptotic to 3/4*n.`
	PROGRAM	`(PARI) a(n)=if(n<2, 1, if(n%2, a(n-1)+1, a(n-1)+a(n/2)%2))`
	CROSSREFS	`Sequence in context: A138467 A127036 A108789 this_sequence A095394 A029928 A101788` `Adjacent sequences: A091957 A091958 A091959 this_sequence A091961 A091962 A091963`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 13 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research