The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255481 a(n) = gcd(b(n),b(n-1)), where b(n) = A255582(n). 3

%I #12 Mar 10 2015 18:07:20

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

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

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

%N a(n) = gcd(b(n),b(n-1)), where b(n) = A255582(n).

%C By definition, a(n) <= A255480(n) for n >= 4.

%H Ray Chandler, <a href="/A255481/b255481.txt">Table of n, a(n) for n = 2..10001</a>

%o a255481 n = a255481_list !! (n-1)

%o a255481_list = zipWith gcd a255582_list \$ tail a255582_list

%o -- _Reinhard Zumkeller_, Mar 10 2015

%Y Cf. A255582, A255480, A255479.

%K nonn

%O 2,4

%A _N. J. A. Sloane_, Feb 28 2015

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.

Last modified November 29 17:22 EST 2023. Contains 367445 sequences. (Running on oeis4.)