id:A082902 - OEIS Search Results

Search: id:A082902

Displaying 1-1 of 1 results found.

page 1

a(n)=gcd[2^n, sigma(2,n)]=gcd[A000079(n), A001157(n)].

+0
2

1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 4, 1, 2, 1, 2, 2, 4, 2, 2, 2, 1, 2, 4, 2, 2, 4, 2, 1, 4, 2, 4, 1, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 2, 1, 1, 4, 2, 2, 4, 4, 2, 4, 2, 2, 4, 2, 2, 2, 1, 4, 4, 2, 2, 4, 4, 2, 1, 2, 2, 2, 2, 4, 4, 2, 2, 1, 2, 2, 4, 4, 2, 4, 2, 2, 2, 4, 2, 4, 2, 4, 2, 2, 1, 2, 1, 2, 4, 2, 2, 8 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Adjacent sequences: A082899 A082900 A082901 this_sequence A082903 A082904 A082905` `Sequence in context: A105307 A082070 A082071 this_sequence A123926 A082064 A082065`
	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 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research