|
Search: id:A038303
|
|
|
| A038303 |
|
Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j. |
|
+0
5
|
|
| 1, 10, 1, 100, 20, 1, 1000, 300, 30, 1, 10000, 4000, 600, 40, 1, 100000, 50000, 10000, 1000, 50, 1, 1000000, 600000, 150000, 20000, 1500, 60, 1, 10000000, 7000000, 2100000, 350000, 35000, 2100, 70, 1, 100000000, 80000000, 28000000
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
T(i,j) is the number of i-permutations of 11 objects a,b,c,d,e,f,g,h,i,j,k, with repetition allowed, containing j a's. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 21 2007
|
|
REFERENCES
|
B. N. Cyvin et al., Isomer enumeration of unbranched catacondensed polygonal systems with pentagons and heptagons, Match, No. 34 (Oct 1996), pp. 109-121.
|
|
EXAMPLE
|
1
10, 1
100, 20, 1
1000, 300, 30, 1
10000, 4000, 600, 40, 1
100000, 50000, 10000, 1000, 50, 1
1000000, 600000, 150000, 20000, 1500, 60, 1
10000000, 7000000, 2100000, 350000, 35000, 2100, 70, 1
100000000, 80000000, 28000000, 5600000, 700000, 56000, 2800, 80, 1
|
|
MAPLE
|
for i from 0 to 8 do seq(binomial(i, j)*10^(i-j), j = 0 .. i) od; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 21 2007
|
|
CROSSREFS
|
Sequence in context: A030526 A164881 A165293 this_sequence A075505 A130310 A051523
Adjacent sequences: A038300 A038301 A038302 this_sequence A038304 A038305 A038306
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
