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 A249617 #8 Nov 28 2014 22:19:19
%S A249617 0,1,1,1,2,1,3,1,3,2,1,3,2,2,4,1,3,3,3,5,1,3,3,3,5,2,5,1,3,3,3,5,2,5,
%T A249617 2,5,4,1,3,3,3,5,2,5,2,5,4,2,5,4,4,6,1,3,3,3,5,3,7,3,7,5,3,7,5,5,8,1,
%U A249617 3,3,3,5,3,7,3,7,5,3,7,5,5,8
%N A249617 Integer partition (A194602) of the n-th set partition (A231428).
%H A249617 Tilman Piesk, <a href="/A249617/b249617.txt">Table of n, a(n) for n = 0..9999</a>
%H A249617 Tilman Piesk, <a href="https://commons.wikimedia.org/wiki/File:Set_partitions_5;_list.svg">Illustrated list of the first 52 equivalence relations</a>
%H A249617 Tilman Piesk, <a href="https://en.wikiversity.org/wiki/Permutations_and_partitions_in_the_OEIS">Permutations and partitions in the OEIS</a> (Wikiversity)
%e A249617 The 6th set partition has 2 non-singleton blocks {1,4} and {2,3}, each with 2 elements. This corresponds to the integer partition 2+2, which is the 3rd in the infinite order defined by A194602. So a(6) = 3.
%K A249617 nonn
%O A249617 0,5
%A A249617 _Tilman Piesk_, Nov 02 2014