Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056787
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056787 Number of incongruental unlabeled undirected trees with n nodes on a square lattice and edges of length 1 or sqrt(2) admitted to the 4 nearest or 4 2nd nearest neighbors. +0
3
1, 2, 6, 40, 303, 2929 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)>=A056841(n) since the trees of A056841 are a subset of these here. Edges along diagonals may cross.

LINKS

M. Vicher, Polyforms

EXAMPLE

For n=2 we have

o-o

and

..o

./.

o..

as the only a(2)=2 candidates. Trees contributing to n=7 are

o.o-o

|\.\.

o.o-o

...\.

....o

or

o....

|\...

o.o-o

...X.

..o.o

./...

o....

where dashes are edges in E, NE, N, NW, W, SW, S or SE direction

that connect nodes marked 'o' horizontally, vertically or along diagonals,

and X's are crossing diagonal edges.

CROSSREFS

See also A056840, A056841.

Sequence in context: A081096 A119692 A098854 this_sequence A098852 A120592 A081471

Adjacent sequences: A056784 A056785 A056786 this_sequence A056788 A056789 A056790

KEYWORD

nonn

AUTHOR

James A. Sellers (sellersj(AT)math.psu.edu), Aug 28 2000

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research