Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116973
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116973 If n mod 2 = 0 then (3^(n+3)-19)/8 else (3^(n+3)-1)/8. +0
1
1, 10, 28, 91, 271, 820, 2458, 7381, 22141, 66430, 199288, 597871, 1793611, 5380840, 16142518, 48427561, 145282681, 435848050, 1307544148, 3922632451, 11767897351, 35303692060, 105911076178, 317733228541, 953199685621 (list; graph; listen)
OFFSET

0,2

COMMENT

Number of moves to solve Type 4 Zig-Zag puzzle.

REFERENCES

Richard I. Hess, Compendium of Over 7000 Wire Puzzles, privately printed, 1991.

Richard I. Hess, Analysis of Ring Puzzles, booklet distributed at 13-th International Puzzle Party, Amsterdam, Aug 20 1993.

MAPLE

f:=n->if n mod 2 = 0 then (3^(n+3)-19)/8 else (3^(n+3)-1)/8; fi;

CROSSREFS

Sequence in context: A124703 A126364 A076712 this_sequence A003665 A066527 A103423

Adjacent sequences: A116970 A116971 A116972 this_sequence A116974 A116975 A116976

KEYWORD

nonn

AUTHOR

njas, Apr 01 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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research