login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256980 Irregular triangle read by rows: row n gives number of connected graphs on n nodes with forcing number k (n>=1, k>=0). 0

%I

%S 1,1,1,1,2,4,8,11,2,35,68,9,252,524,75,2,2994,7161,934,28,68665,

%T 171684,20296,432,3,3013075,7849829,840786,12766,115

%N Irregular triangle read by rows: row n gives number of connected graphs on n nodes with forcing number k (n>=1, k>=0).

%D C. E. Larson and N. Van Cleemput, Forcing Independence, Croatica Chemica Acta, Vol. 86, No. 4, Dec. 2013, 469-475.

%e Triangle begins:

%e 1

%e 1

%e 1 1

%e 2 4

%e 8 11 2

%e 35 68 9

%e 252 524 75 2

%e 2994 7161 934 28

%e 68665 171684 20296 432 3

%e 3013075 7849829 840786 12766 115

%e ...

%K nonn,tabf,more

%O 1,5

%A _N. J. A. Sloane_, Apr 24 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 27 13:59 EDT 2022. Contains 354896 sequences. (Running on oeis4.)