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.

A352067 Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.

This page as a plain text file.
%I A352067 #18 Mar 07 2022 07:55:46
%S A352067 1,0,1,0,1,1,0,2,3,1,0,3,13,4,1,0,6,62,37,6,1,0,11,364,393,77,7,1,0,
%T A352067 23,2799,6485,1665,135,9,1,0,47,27811,158766,68957,5268,220,10,1,0,
%U A352067 106,349306,5718805,5091421,541593,14997,330,12,1
%N A352067 Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.
%H A352067 Pontus von Brömssen, <a href="/A352067/b352067.txt">Rows n = 1..11, flattened</a>
%H A352067 Wikipedia, <a href="https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)">Degeneracy</a>
%e A352067 Triangle begins:
%e A352067   n\k| 0   1      2       3       4      5     6   7  8  9
%e A352067   ---+----------------------------------------------------
%e A352067    1 | 1
%e A352067    2 | 0   1
%e A352067    3 | 0   1      1
%e A352067    4 | 0   2      3       1
%e A352067    5 | 0   3     13       4       1
%e A352067    6 | 0   6     62      37       6      1
%e A352067    7 | 0  11    364     393      77      7     1
%e A352067    8 | 0  23   2799    6485    1665    135     9   1
%e A352067    9 | 0  47  27811  158766   68957   5268   220  10  1
%e A352067   10 | 0 106 349306 5718805 5091421 541593 14997 330 12  1
%Y A352067 Row sums: A001349, column k=1: A000055.
%K A352067 nonn,tabl
%O A352067 1,8
%A A352067 _Pontus von Brömssen_, Mar 05 2022