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 A324080 #9 Feb 15 2019 04:12:52 %S A324080 1,1,3,3,2,2,3,2,4,4,4,4,2,6,6,6,6,6,5,5,5,5,5,6,5,7,7,7,7,7,7,7,3,9, %T A324080 9,9,9,9,9,9,9,8,8,8,8,8,8,8,8,9,8,10,10,10,10,10,10,10,10,10,10,4,12, %U A324080 12,12,12,12,12,12,12,12,12,12,11,11,11,11,11,11,11,11,11,11,11,12,11,13,13,13,13,13,13,13,13,13,13,13,13,13,5 %N A324080 a(n) is the rarest values appearing recorded in n-th pair in A324078. %C A324080 Dropping all but the first occurrence of the terms appears to give A080782. %H A324080 Joerg Arndt, <a href="/A324080/b324080.txt">Table of n, a(n) for n = 1..5000</a> %F A324080 a(n) = A324078(2*n-1). %F A324080 a(n) = A324079(2*n). %Y A324080 See A324081 for the multiplicities. %K A324080 nonn %O A324080 1,3 %A A324080 _Joerg Arndt_, Feb 15 2019