Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063887
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063887 Number of n-step walks on a square lattice starting from the origin but not returning to it at any stage. +0
2
1, 4, 12, 48, 172, 688, 2576, 10304, 39340, 157360, 607376, 2429504, 9442448, 37769792, 147495104, 589980416, 2311926188, 9247704752, 36333781776, 145335127104, 572189853200, 2288759412800, 9025822792896, 36490935746496 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n)/4^n tends to zero as n increases.

FORMULA

a(2n)=4*a(2n-1)-A054474(n); a(2n+1)=4*a(2n).

EXAMPLE

a(2)=12 since there are 16 2-step walks but 4 of them involve a return to the origin at some stage; similarly a(3)=48 since there are 64 3-step walks but 16 of them involve a return to the origin at some stage.

CROSSREFS

Sequence in context: A032380 A057346 A081620 this_sequence A108508 A019309 A056632

Adjacent sequences: A063884 A063885 A063886 this_sequence A063888 A063889 A063890

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Aug 28 2001

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research