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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,4 COMMENTS By definition, a(n) <= A255480(n) for n >= 4. LINKS Ray Chandler, Table of n, a(n) for n = 2..10001 PROG (Haskell) a255481 n = a255481_list !! (n-1) a255481_list = zipWith gcd a255582_list \$ tail a255582_list -- Reinhard Zumkeller, Mar 10 2015 CROSSREFS Cf. A255582, A255480, A255479. Sequence in context: A335211 A038769 A327818 * A241418 A330348 A117229 Adjacent sequences: A255478 A255479 A255480 * A255482 A255483 A255484 KEYWORD nonn AUTHOR N. J. A. Sloane, Feb 28 2015 STATUS approved

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 September 22 05:50 EDT 2023. Contains 365519 sequences. (Running on oeis4.)