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 A078925 #9 Jul 19 2015 01:50:08
%S A078925 1,1,2,1,3,4,1,4,7,10,1,5,10,20,26,1,6,14,35,57,76,1,7,19,56,111,185,
%T A078925 232,1,8,24,84,196,392,600,750,1,9,30,120,324,756,1368,2052,2494,1,10,
%U A078925 37,165,507,1353,2829,4950,7105,8524,1,11,44,220,759,2277,5412,10824
%N A078925 Triangle of T1(n,m) = number of bracelets (necklaces that can be turned over) with m white beads and (2n+1-m) black ones, for 1<=m<=n.
%C A078925 Left half of odd rows of table A052307 with left column deleted.
%H A078925 <a href="/index/Br#bracelets">Index entries for sequences related to bracelets</a>
%e A078925 1; 1, 2; 1, 3, 4; 1, 4, 7, 10; ...
%t A078925 Table[ f[n, 2n + 1], {n, 11}] (* _Robert G. Wilson v_, Mar 29 2006 *)
%Y A078925 Cf. A052307 for full table, A073020 for even number of beads. Last term in each row gives A007123.
%K A078925 nonn,tabl
%O A078925 1,3
%A A078925 Thomas Hartinger (hartinger_t(AT)web.de), Dec 15 2002