Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094788
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094788 Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,....,2n+1, s(0) = 1, s(2n+1) = 6. +0
1
1, 6, 27, 110, 428, 1624, 6069, 22458, 82555, 302082, 1101816, 4009616, 14567657, 52865230, 191684283, 694609494, 2515972324, 9110338728, 32981059485, 119377761602, 432046756571, 1563510554986, 5657752486512, 20472344560800 (list; graph; listen)
OFFSET

2,2

FORMULA

a(n)=(1/5)*Sum(r, 1, 9, Sin(r*Pi/10)Sin(3*r*Pi/5)(2Cos(r*Pi/10))^(2n+1)) a(n)=8a(n-1)-21a(n-2)+20a(n-3)-5a(n-4) G.f.: x^2(1-2x)/(1-8x+21x^2-20x^3+5x^4)

CROSSREFS

Sequence in context: A055145 A037604 A022634 this_sequence A003517 A108958 A005284

Adjacent sequences: A094785 A094786 A094787 this_sequence A094789 A094790 A094791

KEYWORD

nonn

AUTHOR

Herbert Kociemba (kociemba(AT)t-online.de), Jun 15 2004

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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research