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 A196528 #7 Jul 13 2013 12:04:17 %S A196528 4,1,26,11,2,57,13,15,179,77,382,161,92,635,376,513,222,331,420,1961, %T A196528 4080,933,685,103,386,49,1233,33,3520,1317,196,1301,562,3765,902,1769, %U A196528 7549,547,1938,3349,1124,3345,545,275,6606,21277,88,3247,1411,955,6921 %N A196528 Smallest number m such that A196527(m) = n. %C A196528 Smallest number m such that n equals the greatest common divisor of sums of first n prime numbers and first n composite numbers: %C A196528 A196527(a(n)) = n and A196527(m) <> n for m < a(n). %H A196528 Reinhard Zumkeller, <a href="/A196528/b196528.txt">Table of n, a(n) for n = 1..100</a> %K A196528 nonn %O A196528 1,1 %A A196528 _Reinhard Zumkeller_, Oct 03 2011