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 A096099 #17 Nov 20 2018 02:52:14
%S A096099 1,2,3,5,5,2,13,25,8,22,16,26,35,35,11,26,48,58,6,46,4,77,83,29,33,
%T A096099 187,61,78,81,23,183,15,22,68,8,137,84,178,99,7,71,82,142,241,133,71,
%U A096099 56,19,32,318,157,199,303,16,201,201,213,257,355,229,365,379,345,27,52,19,272
%N A096099 a(0) = 1, a(n) = least number such that the concatenation of all terms through a(n) is divisible by prime(n).
%C A096099 Related sequence: numbers k such that a(k) > prime(k): 7, 21, 22, 25, 30, 37, 43, 49, 52, 58, 60, 61, 62 ... (E.g., 7 would be a term since a(7) = 25 > prime(7) = 17.) [edited by _Jon E. Schoenfield_, Nov 19 2018]
%H A096099 Vincenzo Librandi, <a href="/A096099/b096099.txt">Table of n, a(n) for n = 0..1000</a>
%e A096099 a(7) = 25 as the concatenation a(1),a(2),...,a(6),a(7) = 1235521325 == 0 (mod 17), prime(7) = 17.
%t A096099 s = "1"; Print[s]; Do[k = 1; While[Mod[ToExpression[s <> ToString[k]], Prime[n]] != 0, k++ ]; Print[k]; s = s <> ToString[k], {n, 1, 100}] (* _Ryan Propper_, Sep 03 2005 *)
%Y A096099 Cf. A073893.
%K A096099 base,nonn
%O A096099 0,2
%A A096099 _Amarnath Murthy_, Jun 24 2004
%E A096099 a(10)-a(66) from _Ryan Propper_, Sep 03 2005