The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089128 a(n) = gcd(6,n). 16

%I #42 Dec 14 2023 05:15:48

%S 6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,

%T 2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,

%U 2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2,1,6,1,2,3,2

%N a(n) = gcd(6,n).

%C Also greatest common divisor of n^2-6 and n^2+6.

%C The second term of sequences of this type for n=0,1,2... form the sequence 1,2,1,2,1,... in decimal 0.1212121212... = 4/33.

%C Multiplicative with a(p^e) = GCD(p^e, 6). - _David W. Wilson_, Jun 12 2005

%C From _Jaroslav Krizek_, May 27 2010: (Start)

%C a(n) = denominators of averages of squares of the first n positive integers for n >= 1.

%C a(n) is periodic sequence with period (6, 1, 2, 3, 2, 1).

%C See A175485 - numerators of averages of squares of the first n positive integers.

%C a(n) = A175485(n) * n / A000330(n).

%C For n = 337 holds: a(n) = 1 and simultaneously A175485(n) is square ( = 38025 = 195^2), i.e., the number k = 195 is quadratic mean (root mean square) of the first 337 positive integers. There are other such numbers - see A084231 and A084232.

%C Sqrt(A175485(n) / a(n)) for n >= 1 is the harmonic mean of the first n positive integers. (End)

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,1)

%F a(n) = 1 + [2|n] + 2*[3|n] + 2*[6|n] = (15 + 5*(-1)^n + 4*cos(n*Pi/3) + 12*cos(n*2*Pi/3))/6, where [x|y] is 1 if x divides y, 0 otherwise. - _Mitch Harris_ Jun 15 2005

%F From _R. J. Mathar_, Apr 04 2011: (Start)

%F Dirichlet g.f.: zeta(s)*(1+1/2^s+2/3^s+2/6^s).

%F G.f.: (-6 - x - 2*x^2 - 3*x^3 - 2*x^4 - x^5) / ((x-1)*(1+x)*(1 + x + x^2)*(x^2 - x + 1)). (End)

%F a(n) = ((n-1) mod 2 + 1)*( 2*floor(((n-1) mod 3)/2) + 1). - _Gary Detlefs_, Dec 28 2011

%t GCD[Range[0,110],6] (* or *) PadRight[{},110,{6,1,2,3,2,1}] (* _Harvey P. Dale_, Dec 26 2018 *)

%o (PARI) g(n) = for(x=0,n,print1(gcd(x^2-6,x^2+6)","))

%o (Haskell)

%o a089128 = gcd 6 -- _Reinhard Zumkeller_, Apr 06 2015

%K easy,nonn,mult

%O 0,1

%A _Cino Hilliard_, Dec 05 2003

%E Name changed, using _David W. Wilson_'s formula, by _Franklin T. Adams-Watters_, May 16 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 22:07 EDT 2024. Contains 372806 sequences. (Running on oeis4.)