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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109007 GCD(n,3). 10
3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

For n>1: a(n) = GCD of the n-th and (n+2)-th triangular numbers = A050873(A000217(n+2),A000217(n)). - Reinhard Zumkeller, May 28 2007

Contribution from Klaus Brockhaus, May 24 2010: (Start)

Continued fraction expansion of (3+sqrt(17))/2.

Decimal expansion of 311/999. (End)

LINKS

Table of n, a(n) for n=0..100.

Index to sequences with linear recurrences with constant coefficients, signature (0,0,1)

FORMULA

a(n) = 1 + 2*[3|n] = 1 + 2(1 + 2*cos(2*n*Pi/3])/3, where [x|y] = 1 when x divides y, 0 otherwise.

a(n) = a(n-3).

Multiplicative with a(p^e, 3) = GCD(p^e, 3). David W. Wilson Jun 12, 2005.

O.g.f.: -(3+x+x^2)/((x-1)*(x^2+x+1)) . - R. J. Mathar, Nov 24 2007

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

a(n)= 2*floor(((n-1) mod 3)/2) + 1. [From Gary Detlefs, Dec, 28 2011]

CROSSREFS

Cf. A109004.

Cf. A026741, A130334.

Cf. A178255 (decimal expansion of (3+sqrt(17))/2). [From Klaus Brockhaus, May 24 2010]

Sequence in context: A098094 A087283 A111625 * A132951 A101685 A049653

Adjacent sequences:  A109004 A109005 A109006 * A109008 A109009 A109010

KEYWORD

nonn,easy,mult

AUTHOR

Mitch Harris

STATUS

approved

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 June 19 00:01 EDT 2013. Contains 226356 sequences.