id:A082506 - OEIS Search Results

Search: id:A082506

Displaying 1-1 of 1 results found.

page 1

a(n)=GCD[2^n,n-phi[n]]; largest power of 2 dividing cototient[n]=A051953(n).

+0
1

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

	OFFSET	`1,1`
	EXAMPLE	`Different from A069177, analogous sequence with totient, instead of cototient.`
	CROSSREFS	`Cf. A000010, A051953, A009195, A083250, A007283, A050339, A053576, A069177.` `Adjacent sequences: A082503 A082504 A082505 this_sequence A082507 A082508 A082509` `Sequence in context: A137843 A130194 A113926 this_sequence A053000 A002070 A106052`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 28 2003`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research