id:A109014 - OEIS Search Results

Search: id:A109014

Displaying 1-1 of 1 results found.

page 1

GCD(n,11).

+0
3

11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(n) = 1 + 10*[11\|n], where [x\|y] = 1 when x divides y, 0 otherwise.` `a(n) = a(n-11).` `Multiplicative with a(p^e, 11) = GCD(p^e, 11). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	CROSSREFS	`Cf. A109004.` `Sequence in context: A157712 A158215 A118135 this_sequence A130837 A010194 A107045` `Adjacent sequences: A109011 A109012 A109013 this_sequence A109015 A109016 A109017`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research