id:A140473 - OEIS Search Results

Search: id:A140473

Displaying 1-1 of 1 results found.

page 1

Cantor-like stair-step chaotic sequence: a(n)=a(Floor[2*n/3])+a(Floor[n/3]).

+0
2

0, 1, 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 6, 6, 7, 8, 8, 8, 9, 9, 9, 10, 10, 11, 12, 12, 12, 14, 14, 14, 14, 14, 15, 15, 15, 16, 18, 18, 18, 18, 18, 20, 21, 21, 21, 22, 22, 22, 23, 23, 23, 23, 23, 24, 27, 27, 27, 27, 27, 27, 27, 27, 29, 31, 31, 31, 31, 31, 32, 33, 33, 33, 35, 35, 35, 35 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`a(n)=a(Floor[2*n/3])+a(Floor[n/3])`
	MATHEMATICA	`a[0] = 0; a[1] = 1; a[n_] := a[n] = a[Floor[2*n/3]] + a[Floor[n/3]]; b = Table[a[n], {n, 0, 200}]`
	CROSSREFS	`Sequence in context: A005350 A055037 A125186 this_sequence A115384 A131411 A125059` `Adjacent sequences: A140470 A140471 A140472 this_sequence A140474 A140475 A140476`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Jun 28 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:11 EST 2009. Contains 167435 sequences.

AT&T Labs Research