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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035081 Number of increasing asymmetric rooted connected graphs where every block is a complete graph. 3
1, 1, 1, 7, 27, 167, 1451, 12672, 133356, 1573608, 20731512, 299642958, 4732486932, 81201040470, 1500094187292, 29730606352920, 628968809015766, 14147458062941100, 337143091156288002, 8485143902146640124 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

In an increasing rooted graph nodes are numbered and numbers increase as you move away from root.

LINKS

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

C. G. Bower, Transforms (2)

FORMULA

Shifts left when EGJ transform applied twice.

CROSSREFS

Cf. A007549, A007561, A035079, A035080.

Sequence in context: A151496 A202519 A192250 * A193257 A173193 A196323

Adjacent sequences:  A035078 A035079 A035080 * A035082 A035083 A035084

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower, Nov 15 1998.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 21 21:23 EDT 2013. Contains 225505 sequences.