id:A088975 - OEIS Search Results

Search: id:A088975

Displaying 1-1 of 1 results found.

page 1

Breadth-first traversal of the Collatz tree, with the odd child of each node traversed prior to its even child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.

+0
5

1, 2, 4, 8, 16, 5, 32, 10, 64, 3, 20, 21, 128, 6, 40, 42, 256, 12, 13, 80, 84, 85, 512, 24, 26, 160, 168, 170, 1024, 48, 52, 53, 320, 336, 340, 341, 2048, 96, 17, 104, 106, 640, 672, 113, 680, 682, 4096, 192, 34, 208, 35, 212, 213, 1280, 1344, 226, 1360, 227, 1364 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..3517`
	PROGRAM	`(Python: replace leading dots by blanks before running)` `.def A088975():` `... yield 1` `... for x in A088975():` `....... if x > 4 and x % 6 == 4:` `........... yield (x-1)/3` `....... yield 2*x`
	CROSSREFS	`Cf. A127824 (terms at the same depth are sorted)` `Sequence in context: A050076 A070337 A127824 this_sequence A167424 A167425 A016018` `Adjacent sequences: A088972 A088973 A088974 this_sequence A088976 A088977 A088978`
	KEYWORD	`easy,nonn`
	AUTHOR	`David Eppstein (eppstein(AT)ics.uci.edu), Oct 31 2003`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research