id:A122586 - OEIS Search Results

Search: id:A122586

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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/(3^floor(log[3](n))))`
	EXAMPLE	`a(1) = 1/(3^0) = 1`
	MAPLE	`seq( evalf(floor(n/ (3^floor(log[3](n))))), n=1..500);`
	CROSSREFS	`Adjacent sequences: A122583 A122584 A122585 this_sequence A122587 A122588 A122589` `Sequence in context: A139632 A029339 A029364 this_sequence A079487 A069010 A087048`
	KEYWORD	`easy,nonn`
	AUTHOR	`Peter C. Heinig (algorithms(AT)gmx.de), Oct 20 2006`

page 1

Search completed in 0.002 seconds

Last modified October 12 12:15 EDT 2008. Contains 144829 sequences.

AT&T Labs Research