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!)
A135444 Number of partitions into "bus routes" of K_n. 0
1, 1, 3, 63 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

1. One and only one route exists on all edges of G

2. Terminals of two different routes don't meet on the same point

LINKS

Table of n, a(n) for n=1..4.

CROSSREFS

Cf. A131709.

Sequence in context: A301609 A144422 A327053 * A182468 A323726 A087886

Adjacent sequences:  A135441 A135442 A135443 * A135445 A135446 A135447

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto, Feb 18 2008

STATUS

approved

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 13 20:27 EST 2019. Contains 329973 sequences. (Running on oeis4.)