id:A075825 - OEIS Search Results

Search: id:A075825

Displaying 1-1 of 1 results found.

page 1

a(0) = 1, a(1) = 2; for n>0, a(2n) = |a(n)-a(n-1)|, a(2n+1) = a(n)+a(n-1).

+0
2

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

	OFFSET	`0,2`
	CROSSREFS	`Sequence in context: A020650 A124224 A014599 this_sequence A007735 A002616 A046073` `Adjacent sequences: A075822 A075823 A075824 this_sequence A075826 A075827 A075828`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Oct 14 2002`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research