A022921 - OEIS

This site is supported by donations to The OEIS Foundation.

A022921

Number of 2^m between 3^n and 3^(n+1).

1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`Represents increments between successive terms of allowable dropping times in the Collatz (3x+1) problem. i.e. a(n) = A020914(n+1) - A020914(n). [From K. Spage (kevspage2001(AT)yahoo.co.uk), Oct 23 2009]`
	FORMULA	`(n+1)log_2(3) - nlog_2(3).`
	MAPLE	`Digits := 100: c1 := log(3.)/log(2.): A022921 := n->floor((n+1)c1)-floor(nc1);`
	CROSSREFS	`cf. a(n) = A122437(n+2)-A122437(n+1)-1. [From K. Spage (kevspage2001(AT)yahoo.co.uk), Oct 23 2009]` `Sequence in context: A023582 A195969 A023518 * A080763 A165413 A172155` `Adjacent sequences: A022918 A022919 A022920 * A022922 A022923 A022924`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:13 EST 2012. Contains 205828 sequences.