Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003773
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003773 Number of spanning trees in K_4 X P_n. +0
1
16, 3456, 686000, 135834624, 26894628304, 5325000912000, 1054323287943536, 208750686023540736, 41331581509440922000, 8183444388183674181504, 1620280657278860350213424, 320807386696826179092096000 (list; graph; listen)
OFFSET

1,1

LINKS

Paul Raff (praff(AT)math.rutgers.edu), Jun 04 2008, Table of n, a(n) for n = 1..15

F. Faase, Counting Hamilton cycles in product graphs

Index entries for sequences related to trees

FORMULA

a(n) = 204*a(n-1) - 1190*a(n-2) + 204*a(n-3) - a(n-4) - Paul Raff (praff(AT)math.rutgers.edu), Jun 04 2008

CROSSREFS

Adjacent sequences: A003770 A003771 A003772 this_sequence A003774 A003775 A003776

Sequence in context: A091160 A049030 A051551 this_sequence A087519 A060616 A016936

KEYWORD

nonn

AUTHOR

Frans Faase (Frans_LiXia(AT)wxs.nl)

EXTENSIONS

More terms from Paul Raff (praff(AT)math.rutgers.edu), Jun 04 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research