Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131636
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131636 List of impossible triples {V, F, E} that satisfy Euler's equation V=E-F+2 but do not correspond to polyhedra. +0
1
0, 2, 0, 0, 3, 1, 1, 1, 0, 1, 2, 1, 1, 3, 2, 2, 0, 0, 2, 1, 1, 2, 2, 2, 2, 3, 3, 3, 0, 1, 3, 1, 2, 3, 2, 3, 3, 3, 4 (list; graph; listen)
OFFSET

1,2

COMMENT

This set of triples seems to be a finite set of "graphs" that are Euler solutions but not polyhedra.

FORMULA

If V<4 and F<4 and E<7 and V=E-F+2: a(n) = {V(m),F(m),E(m)}

MATHEMATICA

a = Delete[Union[Flatten[Table[If[v + f - 2 - e0 == 0, {v, f, e0}, {}], {v, 0, 3}, {f, 0, 3}, {e0, 0, 6}], 2]], 1]; Flatten[a]

CROSSREFS

Cf. A130840.

Sequence in context: A029301 A082660 A134673 this_sequence A077888 A113411 A125095

Adjacent sequences: A131633 A131634 A131635 this_sequence A131637 A131638 A131639

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 05 2007

EXTENSIONS

Partially edited by njas, Sep 14 2007.

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research