This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A338440 #12 Aug 23 2024 17:17:32 %S A338440 1,2,1,3,1,1,5,2,1,1,7,2,1,3,5,2,1,1,11,2,1,3,7,2,1,3,1,11,5,2,1,13,1, %T A338440 3,4,1,1,17,2,1,19,1,3,5,2,7,3,1,17,5,2,1,23,1,3,2,11,1,7,5,3,1,2,13, %U A338440 3,1,1,5,13,2,1,29,1,3,10,1,1,31,2,1,1,37 %N A338440 a(n) is the greatest common divisor of A338338(n), A338338(n+1) and A338338(n+2). %C A338440 No prime factor of a(n) divides A338338(n+3). %H A338440 Rémy Sigrist, <a href="/A338440/b338440.txt">Table of n, a(n) for n = 1..10000</a> %H A338440 Rémy Sigrist, <a href="/A338440/a338440.txt">C program for A338440</a> %F A338440 gcd(a(n), A338338(n+3)) = 1. %e A338440 a(4) = gcd(A338338(4), A338338(5), A338338(6)) = gcd(6, 3, 9) = 3. %o A338440 (C) // See Links section. %Y A338440 Cf. A338338. %K A338440 nonn %O A338440 1,2 %A A338440 _Rémy Sigrist_, Oct 28 2020