login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038315 Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*1^j. 5

%I

%S 1,11,1,121,22,1,1331,363,33,1,14641,5324,726,44,1,161051,73205,13310,

%T 1210,55,1,1771561,966306,219615,26620,1815,66,1,19487171,12400927,

%U 3382071,512435,46585,2541,77,1,214358881,155897368,49603708

%N Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*1^j.

%C T(i,j) is the number of i-permutations of 12 objects a,b,c,d,e,f,g,h,i,j,k,l, with repetition allowed, containing j a's. - _Zerinvary Lajos_, Dec 21 2007

%D B. N. Cyvin et al., Isomer enumeration of unbranched catacondensed polygonal systems with pentagons and heptagons, Match, No. 34 (Oct 1996), pp. 109-121.

%e 1

%e 11, 1

%e 121, 22, 1

%e 1331, 363, 33, 1

%e 14641, 5324, 726, 44, 1

%e 161051, 73205, 13310, 1210, 55, 1

%e 1771561, 966306, 219615, 26620, 1815, 66, 1

%e 19487171, 12400927, 3382071, 512435, 46585, 2541, 77, 1

%e 214358881, 155897368, 49603708, 9018856, 1024870, 74536, 3388, 88, 1

%p for i from 0 to 8 do seq(binomial(i, j)*11^(i-j), j = 0 .. i) od; # _Zerinvary Lajos_, Dec 21 2007

%t Table[Binomial[i,j]11^(i-j),{i,0,10},{j,0,i}]//Flatten (* _Harvey P. Dale_, Nov 10 2022 *)

%K nonn,tabl,easy

%O 0,2

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 31 04:26 EST 2023. Contains 359947 sequences. (Running on oeis4.)