Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125094
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125094 Eigensequence of A061554 regarded as a triangle: a(n) = Sum_{k=0..n-1} A061554(n-1,k)*a(k) with a(0)=1. +0
2
1, 1, 2, 5, 13, 36, 104, 313, 977, 3152, 10486, 35880, 126039, 453725, 1671322, 6291148, 24170312, 94680426, 377788108, 1534169595, 6335718925, 26589240583, 113323479393, 490203781505, 2150975413846, 9569147610181, 43140286838567 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Sum_{k=0..n-1} a(k)*C(n-1, floor[n/2 - (-1)^(n-k-1)*(k+1)/2] ).

EXAMPLE

a(4) = 3*(1) + 3*(1) + 1*(2) + 1*(5) = 13.

a(5) = 6*(1) + 4*(1) + 4*(2) + 1*(5) + 1*(13) = 36.

a(6) = 10*(1) + 10*(1) + 5*(2) + 5*(5) + 1*(13) + 1*(36) = 104.

Triangle version of A061554 begins:

1;

1, 1;

2, 1, 1;

3, 3, 1, 1;

6, 4, 4, 1, 1;

10, 10, 5, 5, 1, 1; ...

PROGRAM

(PARI) {a(n)=if(n==0, 1, sum(k=0, n-1, a(k)*binomial(n-1, n\2+(-1)^(n-k)*((k+1)\2))))}

CROSSREFS

Cf. A061554.

Sequence in context: A036765 A136751 A087626 this_sequence A114465 A135310 A135337

Adjacent sequences: A125091 A125092 A125093 this_sequence A125095 A125096 A125097

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 20 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 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research