id:A109011 - OEIS Search Results

Search: id:A109011

Displaying 1-1 of 1 results found.

page 1

GCD(n,8).

+0
3

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

	OFFSET	`0,1`
	FORMULA	`a(n) = 1 + [2\|n] + 2[4\|n] + 4[8\|n], where [x\|y] = 1 when x divides y, 0 otherwise.` `a(n) = a(n-8).` `Multiplicative with a(p^e, 8) = GCD(p^e, 8). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	CROSSREFS	`Cf. A109004.` `Sequence in context: A156766 A111835 A010154 this_sequence A019763 A105473 A010518` `Adjacent sequences: A109008 A109009 A109010 this_sequence A109012 A109013 A109014`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research