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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083202 a(n) = gcd(A000055(n), A000055(n+1)). 1
 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 3, 15, 15, 1, 2, 1, 1, 10, 10, 92, 1, 1, 2, 1, 1, 1, 1, 6, 6, 2, 2, 57, 1, 1, 15, 3, 2, 2, 2, 5, 3, 6, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 4, 12, 69, 69, 6, 186, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 EXAMPLE A000055(6)=6, A000055(7)=11, so a(6) = gcd(6,11) = 1. PROG (PARI) {v=[1, 1, 1, 1, 2, 3, 6, 11, 23, 47, 106, 235, 551, 1301, 3159, 7741, 19320, 4 8629, 123867, 317955, 823065, 2144505, 5623756, 14828074, 39299897, 104636890, 2 79793450, 751065460, 2023443032, 5469566585, 14830871802, 40330829030, 109972410] for (i=1, length(v)-1, print1(gcd(v[i], v[i+1])", "))} CROSSREFS Cf. A000055. Sequence in context: A049586 A342466 A133721 * A030560 A030559 A030558 Adjacent sequences:  A083199 A083200 A083201 * A083203 A083204 A083205 KEYWORD nonn AUTHOR Jon Perry, Jun 01 2003 EXTENSIONS More terms from Alois P. Heinz, Sep 26 2011 STATUS approved

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

Last modified January 18 00:50 EST 2022. Contains 350410 sequences. (Running on oeis4.)