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 A386597 #10 Jul 31 2025 16:57:20 %S A386597 1,4,8,16,29,50,82 %N A386597 Number of distinct values of the permanent of an n X n (0,1)-matrix with exactly three 1's in each row. %C A386597 a(n) > A185178(n) for n >= 4. %C A386597 The permanents for a(n) contain all permanents from a(n-1). %C A386597 a(10) >= 121. %C A386597 a(11) >= 186. %C A386597 a(12) >= 276. %C A386597 a(13) >= 422. %C A386597 a(14) >= 638. %C A386597 a(15) >= 824. %H A386597 Robert P. P. McKone, <a href="/A386597/a386597.txt">Complete frequency counts for each permanent for a(3)..a(9)</a> %H A386597 Robert P. P. McKone, <a href="/A386597/a386597.cpp.txt">C++ code for enumerating and counting each permanent's frequency for a(n)</a> %H A386597 Robert P. P. McKone, <a href="/A386597/a386597_1.txt">Known permanents through simulation for a(10)..a(15)</a> %Y A386597 Cf. A185178 (number of distinct permanents with exactly three 1's in each row and column). %K A386597 nonn,hard,more %O A386597 3,2 %A A386597 _Robert P. P. McKone_, Jul 27 2025