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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060202 Let G = complete graph on 4 vertices, create the sequence G, L(G), L(L(G)), L(L(L(G))), ... where each graph in this sequence is the line graph of the previous graph; a(n) is number of vertices of the n-th graph in this sequence. 0
 4, 6, 12, 36, 180, 1620, 27540, 908820, 59073300, 7620455700, 1958457114900, 1004688499943700, 1029805712442292500, 2110071904794257332500, 8644964593942072291252500, 70828194918167398282231732500 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS If G is k-regular, then L(G) is (2k-2)-regular. From this it is easy to get the formula for a(n). LINKS FORMULA a(0)=4 and for n >= 1 a(n) = 4 * product k=1...n (1+2^(k-2)) EXAMPLE The line graph of the complete graph on 4 vertices has C(4,2) vertices so a(1) = 6. MAPLE for n from 0 to 30 do printf(`%d, `, 4*product(1+2^(k-2), k=1..n)) od: CROSSREFS Sequence in context: A275978 A242211 A073167 * A062624 A154666 A050537 Adjacent sequences:  A060199 A060200 A060201 * A060203 A060204 A060205 KEYWORD nonn AUTHOR Avi Peretz (njk(AT)netvision.net.il), Mar 18 2001 EXTENSIONS More terms from James A. Sellers and Vladeta Jovovic, Mar 26 2001 STATUS approved

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.

Last modified November 26 04:47 EST 2022. Contains 358353 sequences. (Running on oeis4.)