login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007832 Number of point labeled 5,6-free two-graphs with n nodes. 0

%I

%S 1,1,2,8,52,457,4979,64591,972906,16701834,322063458,6894918021,

%T 162316253829,4168330738093,115980086558470,3476156853885992,

%U 111665862911781864,3827642575341002133,139457935266705019299,5382149182666970080019,219344947692643001216702

%N Number of point labeled 5,6-free two-graphs with n nodes.

%H P. J. Cameron, <a href="http://www.combinatorics.org/Volume_2/volume2.html#R4">Counting two-graphs related to trees</a>, Elec. J. Combin., Vol. 2, #R4.

%F STIRLING transform of A007831. - _Sean A. Irvine_, Feb 03 2018

%Y Cf. A007831.

%K nonn

%O 1,3

%A _Peter J. Cameron_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 04:15 EST 2019. Contains 329885 sequences. (Running on oeis4.)