id:A109013 - OEIS Search Results

Search: id:A109013

Displaying 1-1 of 1 results found.

page 1

GCD(n,10).

+0
3

10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(n) = 1 + [2\|n] + 4[5\|n] + 4[10\|n], where [x\|y] = 1 when x divides y, 0 otherwise.` `a(n) = a(n-10).` `Multiplicative with a(p^e, 10) = GCD(p^e, 10). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	CROSSREFS	`Cf. A109004.` `Sequence in context: A015124 A156767 A010180 this_sequence A085764 A090555 A010179` `Adjacent sequences: A109010 A109011 A109012 this_sequence A109014 A109015 A109016`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research