#ATTENDANCE QUIZ FOR LECTURE 21 of Dr. Z.'s Math454(02) Rutgers University


# Please Edit this .txt page with Answers


#Email  ShaloshBEkhad@gmail.com 
#Subject: p21
#with an attachment called
#p21FirstLast.txt
#(e.g. p21DoronZeilberger.txt)


#Right after finishing watching the lecture but no later than Nov. 20, 2020, 8:00pm




THE NUMBER OF ATTENDANCE QUESTIONS WERE: 3


PLEASE LIST ALL THE QUESTIONS FOLLOWED, AFTER EACH, BY THE ANSWER


1. How many graphs are there with 30 vertices and 50 edges? 
A: 616531513027177775473601317524937092680978914590598004251998471840


2. How many labeled connected graphs are there with 30 vertices and 50 edges? 
A: AllGraphsK(30,50); 


3. For i = 1, 2, 3, 4, 5 find the OEIS A number of NuKcomp(20, i). What is the smallest i for which it is not in the OEIS? 
A: 


NuKcomp(20, 2) - A323875
NuKcomp(20, 3) - A323876
NuKcomp(20, 4) - A323877
NuKcomp(20, 5) - not in OEIS