Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051289
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A051289
%S A051289 1,2,1,4,4,2,8,12,12,3,16,32,48,24,6,32,80,160,120,60,10,64,192,480,
%T A051289 480,360,120,20,128,448,1344,1680,1680,840,280,35,256,1024,3584,5376,
%U A051289 6720,4480,2240,560,70,512,2304,9216,16128,24192
%N A051289 Triangular array T read by rows: T(n,k)=P(2n+1,n,2k+1), where P(n,k,c)=number 
               of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) 
               for exactly c values of i.
%C A051289 P(n,k,n) counts palindromes.
%F A051289 E.g.f.: exp(2*y)*(BesselI(0, 2*x*y)+BesselI(1, 2*x*y)). - Vladeta Jovovic 
               (vladeta(AT)eunet.rs), Dec 15 2004
%e A051289 Rows: (1); (2,1}; {4,4,2}; ...
%Y A051289 Cf. A001700 (=row sums).
%Y A051289 Sequence in context: A086145 A113421 A135366 this_sequence A090802 A129159 
               A095830
%Y A051289 Adjacent sequences: A051286 A051287 A051288 this_sequence A051290 A051291 
               A051292
%K A051289 nonn,tabl
%O A051289 0,2
%A A051289 Clark Kimberling (ck6(AT)evansville.edu)

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research