Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051436
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051436 Undirected walks of length n+1 on tetrahedron, visiting n+2 vertices, with n "corners", as in A001998, but allowing only rigid motions in 3-space (|G| = 12). Walks are not self-avoiding. +0
2
1, 2, 5, 12, 39, 111, 350, 1044, 3201, 9627, 29150, 87672, 264069, 793431, 2384450, 7159164, 21494001, 64507827, 193589270, 580878432, 1742897949, 5229157551, 15688522250 (list; graph; listen)
OFFSET

0,2

FORMULA

n=2m: (3^n+3^m)/2 -2^(n-1)+2^(m-1); n=2m+1: (3^n+3^m)/2 - 2^(n-1) +1

EXAMPLE

For n=2 there are three walks that stay in one face, and two that visit two faces.

CROSSREFS

Cf. A001998, A001444.

Sequence in context: A036782 A050237 A050258 this_sequence A054581 A005664 A009739

Adjacent sequences: A051433 A051434 A051435 this_sequence A051437 A051438 A051439

KEYWORD

nonn,nice,easy

AUTHOR

Colin Mallows colinm(AT)research.avayalabs.com

EXTENSIONS

Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 09 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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research