Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097207
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A097207
%S A097207 1,1,3,1,4,5,1,5,9,7,1,6,14,16,9,1,7,20,30,25,11,1,8,27,50,55,36,13,1,
               9,
%T A097207 35,77,105,91,49,15,1,10,44,112,182,196,140,64,17,1,11,54,156,294,378,
%U A097207 336,204,81,19,1,12,65,210,450,672,714,540,285,100,21,1,13,77,275,660
%N A097207 Triangle read by rows: T(n,k) = binomial(n,k) + 2*binomial(n,k-1).
%D A097207 H. W. Gould, Power sum identities for arbitrary symmetric arrays, SIAM 
               J. Appl. Math., 17 (1969), 307-316.
%e A097207 Triangle begins:
%e A097207 1
%e A097207 1 3
%e A097207 1 4 5
%e A097207 1 5 9 7
%e A097207 1 6 14 16 9
%t A097207 T[n_, k_] := Binomial[n, k] + 2Binomial[n, k - 1]; Flatten[ Table[ T[n, 
               k], {n, 0, 10}, {k, 0, n}]] (from Robert G. Wilson v Sep 21 2004)
%Y A097207 Sequence in context: A036412 A016473 A029637 this_sequence A118469 A069203 
               A046070
%Y A097207 Adjacent sequences: A097204 A097205 A097206 this_sequence A097208 A097209 
               A097210
%K A097207 nonn,tabl,easy
%O A097207 0,3
%A A097207 N. J. A. Sloane (njas(AT)research.att.com), Sep 21 2004
%E A097207 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 21 2004

    
page 1

Search completed in 0.001 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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research