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 A279086 #5 Jan 16 2017 14:25:48
%S A279086 1,2,3,3,4,1,1,5,5,2,2,1,1,3,2,2,2,1,1,2,2,3,3,1,1,5,5,3,3,1,1,2,4,4,
%T A279086 3,1,1,3,3,2,2,1,1,3,2,2,2,1,1,2,2,5,5,1,1,3,3,4,4,1,1,2,3,3,3,1,1,4,
%U A279086 5,2,2,1,1,3,2,2,2,1,1,2,2,4,4,1,1,3,6
%N A279086 Number of distinct residues n mod p encountered before the first repeated residue as p runs through the primes.
%C A279086 A279073(j) = min_{n : a(n) >= j}.
%C A279086 A279074(j) = min_{n : a(n) = j}.
%e A279086 For n=11, the residues n mod prime(j) for j>=1 begin with 11 mod 2 = 1, 11 mod 3 = 2, and 11 mod 5 = 1; the first 2 residues are distinct, but the 3rd is a repeat of an earlier one, so a(11) = 2.
%e A279086 For n=87, the residues n mod prime(j) for j>=1 begin with 87 mod 2 = 1, 87 mod 3 = 0, 87 mod 5 = 2, 87 mod 7 = 3, 87 mod 11 = 10, 87 mod 13 = 9, 87 mod 17 = 2; the first 6 residues are all distinct, but the 7th is a repeat (87 mod 17 = 87 mod 5 = 2), so a(87) = 6.
%Y A279086 Cf. A279073, A279074.
%K A279086 nonn
%O A279086 1,2
%A A279086 _Jon E. Schoenfield_, Jan 15 2017