A082506 - OEIS

This site is supported by donations to The OEIS Foundation.

A082506

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

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; refs; listen; history; text; internal format)

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

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

Last modified May 25 08:17 EDT 2013. Contains 225646 sequences.