id:A082903 - OEIS Search Results

Search: id:A082903

Displaying 1-1 of 1 results found.

page 1

a(n)=gcd[2^n, sigma(1,n)]=gcd[A000079(n), A000203(n)] also a(n)=gcd[2^n, sigma(3,n)]=gcd[A000079(n), A001158(n)] These 2 definitions seems to be equivalent. Needs proof.

+0
1

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

	OFFSET	`1,3`
	CROSSREFS	`Cf. A000203, A001157, A001158, A082902.` `Adjacent sequences: A082900 A082901 A082902 this_sequence A082904 A082905 A082906` `Sequence in context: A010126 A021712 A014571 this_sequence A125560 A046573 A006287`
	KEYWORD	`nonn,mult`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 22 2003`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research