id:A007813 - OEIS Search Results

Search: id:A007813

Displaying 1-1 of 1 results found.

page 1

Number of planar Steinhaus graphs with n nodes.

+0
3

1, 2, 4, 8, 16, 32, 59, 75, 65, 56, 50, 44, 36, 31, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`Wayne M. Dymacek, Jean-Guy Speton and Tom Whaley, Planar Steinhaus Graphs, Congressus Numerantium, volumes 142-147, 2000.`
	FORMULA	`a(n) = 26 for n>15.`
	CROSSREFS	`Sequence in context: A033860 A115909 A056644 this_sequence A005309 A078389 A059173` `Adjacent sequences: A007810 A007811 A007812 this_sequence A007814 A007815 A007816`
	KEYWORD	`nonn`
	AUTHOR	`Wayne M. Dymacek (wdymacek(AT)wlu.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research