id:A114183 - OEIS Search Results

Search: id:A114183

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; if [sqrt(a(n-1))] is already in the sequence, a(n)=[sqrt(a(n-1))], otherwise a(n) = 2a(n-1).

+0
1

1, 2, 4, 8, 16, 32, 5, 10, 3, 6, 12, 24, 48, 96, 9, 18, 36, 72, 144, 288, 576, 1152, 33, 66, 132, 11, 22, 44, 88, 176, 13, 26, 52, 7, 14, 28, 56, 112, 224, 448, 21, 42, 84, 168, 336, 672, 25, 50, 100, 200, 400, 20, 40, 80, 160, 320, 17, 34, 68, 136, 272, 544, 23, 46, 92 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`One can prove by induction that n must appear in the sequence before [n/2], showing that the sequence is one-to-one; and that frac(log_2(log_2(a(n))) is dense in [0,1), from which it follows that a(n) is onto.`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Cf. A000196, A000523.` `Sequence in context: A010747 A036130 A122169 this_sequence A036129 A088976 A016020` `Adjacent sequences: A114180 A114181 A114182 this_sequence A114184 A114185 A114186`
	KEYWORD	`nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Feb 04 2006`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research