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.

A294490 Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.

This page as a plain text file.
%I A294490 #15 Jan 29 2025 11:25:35
%S A294490 1,1,0,1,1,0,1,4,1,0,1,11,8,1,0,1,34,63,13,1,0,1,103,524,205,19,1,0,1,
%T A294490 405,5863,4308,513,26,1,0,1,1892,100702,135563,21782,1105,34,1,0,1,
%U A294490 12166,2880002,7161399,1576634,84185,2140,43,1,0,1,105065,138772607,652024627,203380116,12140094,274156,3845,53,1,0
%N A294490 Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.
%C A294490 Bivariate inverse Euler transform of A263341. This sequence can be derived from A263341 because the independence number of a disconnected graph is the sum of the independence numbers of its components. - _Andrew Howroyd_, Feb 19 2020
%H A294490 Andrew Howroyd, <a href="/A294490/b294490.txt">Table of n, a(n) for n = 1..91</a> (first 13 rows derived from Brendan McKay data in A263341)
%e A294490 Triangle begins:
%e A294490   1;
%e A294490   1,   0;
%e A294490   1,   1,    0;
%e A294490   1,   4,    1,    0;
%e A294490   1,  11,    8,    1,   0;
%e A294490   1,  34,   63,   13,   1,  0;
%e A294490   1, 103,  524,  205,  19,  1, 0;
%e A294490   1, 405, 5863, 4308, 513, 26, 1, 0;
%e A294490   ...
%Y A294490 Columns 2..5 are A243781, A243782, A243783, A243784.
%Y A294490 Row sums give A001349.
%Y A294490 Cf. A263341 (not necessarily connected).
%K A294490 nonn,tabl
%O A294490 1,8
%A A294490 _Andrew Howroyd_, Oct 31 2017
%E A294490 Terms a(56) and beyond derived from A263341 added by _Andrew Howroyd_, Feb 19 2020