id:A049116 - OEIS Search Results

Search: id:A049116

Displaying 1-1 of 1 results found.

page 1

Repeatedly apply Euler phi to n; a(n) = highest power of 2 that is seen.

+0
3

1, 2, 2, 4, 4, 2, 2, 8, 2, 4, 4, 4, 4, 2, 8, 16, 16, 2, 2, 8, 4, 4, 4, 8, 8, 4, 2, 4, 4, 8, 8, 32, 8, 16, 8, 4, 4, 2, 8, 16, 16, 4, 4, 8, 8, 4, 4, 16, 4, 8, 32, 8, 8, 2, 16, 8, 4, 4, 4, 16, 16, 8, 4, 64, 16, 8, 8, 32, 8, 8, 8, 8, 8, 4, 16, 4, 16, 8, 8, 32, 2, 16, 16, 8, 64, 4, 8, 16, 16, 8, 8, 8 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`If n is a power of 2, then it is of largest exponent. If n=2400, then its phi-sequence is {2400,640,256,128,64,32,16,8,4,2,1}. The value of first power of 2 is 256. Thus a(2400)=256.`
	CROSSREFS	`A000010.` `Sequence in context: A098979 A071928 A130501 this_sequence A065176 A060267 A048244` `Adjacent sequences: A049113 A049114 A049115 this_sequence A049117 A049118 A049119`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research