Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033190
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033190 Sum(binomial(n,k)*binomial(fibonacci(k)+1,2),k=0..n). +0
1
0, 1, 3, 9, 28, 90, 297, 1001, 3431, 11917, 41820, 147918, 526309, 1881009, 6744843, 24244145, 87300092, 314765506, 1135980801, 4102551897, 14823628015, 53581222773, 193724727804, 700551945014 (list; graph; listen)
OFFSET

0,3

COMMENT

Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,....,2n, s(0) = 1, s(2n) = 3. - Herbert Kociemba (kociemba(AT)t-online.de), Jun 14 2004

FORMULA

G.f.: (-x^4+6x^3-5x^2+x)/[(1-3x+x^2)(1-5x+5x^2)].

a(n)=(1/5)*Sum(r, 1, 9, Sin(r*Pi/10)Sin(3*r*Pi/10)(2Cos(r*Pi/10))^(2n)), n>=1 a(n)=8a(n-1)-21a(n-2)+20a(n-3)-5a(n-4), n>=5 - Herbert Kociemba (kociemba(AT)t-online.de), Jun 14 2004

CROSSREFS

Sequence in context: A094164 A094803 A094826 this_sequence A071724 A000245 A047047

Adjacent sequences: A033187 A033188 A033189 this_sequence A033191 A033192 A033193

KEYWORD

nonn

AUTHOR

njas

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research