login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109011 GCD(n,8). 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; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,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.

G.f. ( -8-x-2*x^2-x^3-4*x^4-x^5-2*x^6-x^7 ) / ( (x-1)*(1+x)*(x^2+1)*(x^4+1) ). - R. J. Mathar, Apr 04 2011

Dirichlet g.f. zeta(s)*(1 +1/2^s +2/4^s +4/8^s). - R. J. Mathar, Apr 04 2011

CROSSREFS

Cf. A109004.

Sequence in context: A111835 A198830 A010154 * A019763 A179050 A176458

Adjacent sequences:  A109008 A109009 A109010 * A109012 A109013 A109014

KEYWORD

nonn,easy,mult

AUTHOR

Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:24 EST 2012. Contains 205614 sequences.