id:A080776 - OEIS Search Results

Search: id:A080776

Displaying 1-1 of 1 results found.

page 1

Oscillating sequence which rises to 2^(k-1) in k-th segment (k>=1) then falls back to 0.

+0
2

0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 3, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 31, 30 (list; graph; listen)

	OFFSET	`0,6`
	COMMENT	`k-th segment has length 2^k (k>=0).`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`G.f.: -1 + 2/(1-x) + 1/(1-x)^2 * (-1 + sum(k>=0, 2t^2(t-1), t=x^2^k)). a(n) = A005942(n+2) - 3(n+1), n>0. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 13 2003` `a(0)=0, a(2n) = a(n) + a(n-1) + (n==1), a(2n+1) = 2a(n). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 20 2003`
	CROSSREFS	`Essentially the same as A053646.` `Sequence in context: A037834 A004074 A053646 this_sequence A065358 A070566 A062329` `Adjacent sequences: A080773 A080774 A080775 this_sequence A080777 A080778 A080779`
	KEYWORD	`nonn`
	AUTHOR	`njas, Mar 11 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research