cp's OEIS Frontend

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.

A373072 Row sums of A346914.

This page as a plain text file.
%I A373072 #11 May 23 2024 11:54:33
%S A373072 0,1,0,3,2,1,0,6,5,4,3,3,2,4,1,0,10,9,8,7,6,7,6,5,8,5,4,7,3,4,3,6,2,4,
%T A373072 1,0,15,14,13,12,11,10,12,11,10,9,13,10,9,8,12,8,7,11,6,9,8,7,11,7,6,
%U A373072 10,5,9,8,6,5,9,4,12,11,7,3,5,4,8,3,10,6,2,9,4,1,0
%N A373072 Row sums of A346914.
%C A373072 See A346914 for more information.
%H A373072 Paolo Xausa, <a href="/A373072/b373072.txt">Table of n, a(n) for n = 2..7813</a>
%t A373072 (* Uses Algorithm O from Knuth's TAOCP section 7.2.1.6 *)
%t A373072 olist[m_] := Block[{p = Range[m] - 1, j, d, k},
%t A373072     Reap[
%t A373072     While[True,
%t A373072         Sow[p];
%t A373072         If[p[[m]] > 0,
%t A373072             p[[m]] = p[[p[[m]]]],
%t A373072             k = m; While[k > 0 && p[[--k]] == 0];
%t A373072             If[k == 0, Break[]];
%t A373072             j = p[[k]]; d = k-- -j;
%t A373072             While[++k <= m, p[[k]] = If[p[[k-d]] == p[[j]], p[[j]], p[[k-d]] + d]]
%t A373072     ]]][[2, 1]]];
%t A373072 Flatten[Total[Array[olist, 6], {3}]]
%Y A373072 Cf. A346914.
%K A373072 nonn
%O A373072 2,4
%A A373072 _Paolo Xausa_, May 22 2024