id:A122587 - OEIS Search Results

Search: id:A122587

Displaying 1-1 of 1 results found.

page 1

Digits 1, 2 and 3 appear alternately and each time in runs whose lengths are the powers of 4.

+0
1

1, 2, 3, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n)=floor(n/(4^floor(log[4](n))))`
	EXAMPLE	`a(1)=1/(4^0)=1`
	MAPLE	`seq( evalf(floor(n/ (4^floor(log[4](n))))), n=1..500);`
	CROSSREFS	`Sequence in context: A081371 A027870 A070077 this_sequence A086195 A086197 A139336` `Adjacent sequences: A122584 A122585 A122586 this_sequence A122588 A122589 A122590`
	KEYWORD	`easy,nonn`
	AUTHOR	`Peter C. Heinig (algorithms(AT)gmx.de), Oct 20 2006`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research