Influenza Virus

thingiverse

A Pascal's Triangle sequence generated from the coordinates in your request: ``` 1 1 3 1 6 8 1 9 24 27 28 1 16 30 48 42 33 22 26 34 55 65 56 53 45 35 23 40 63 74 78 70 66 54 39 25 36 64 87 102 108 97 91 73 51 31 16 69 95 126 147 148 137 130 107 83 52 29 119 164 195 220 228 218 211 180 136 94 46 197 254 285 312 322 308 300 257 192 127 63 The 7th row and the row with height 7 are: 23,40,64 95, 119 A more efficient way to produce these numbers, without creating unnecessary storage space would be: ```c int Pascal(int i,int n) { int r, a = i/2,nr=0; nr=a+n*(n-1); if(n==1)return a; return nr=Pascal(r,i%2<n) +(nr>=0?Pascal(nr,a>nr:n)>a : -9999999); } ``` It first counts out each entry (from left to right in binary). Next, given the row number i, it looks up the appropriate Pascal Triangle Number by checking 1 or n-1 based on if n%2 < 7/2 . The algorithm for each column, then calculates Pascal Triangle number and the result from `nr >=0` as integer (as negative int values overflow) Then return both integers and the value to insert, with i-4 > 7 giving out one or three spaces respectively ``` function nPascal() { function factorial(n) { if (!n) { return 1; } else { return (factorial(n - 1)) * n; } } function C(i, k) var total = factorial(10); total / (Math.pow(factorial(i),k) ) } for(i=0;i<=3;i++) { var output=i.toString(); output+=" "; C(output.split(",").map(Number)) return ``` It also works in reverse - with Pascal triangle being made by first making a square of squares that sums up all the values and second then generating triangles. There is one possible application where a 100% complete triangle must be built - using each value, the value will become negative to be inserted from i to n . It generates rows only on demand from user and creates the array of size k to start building it in. ```javascript let c; let count =0 ; function makeIt(x) { if (c[x]==1){return 2} count++; c.push( count); if (makeIt(x+2)){ count += x} } return count } let PascalRow; PascalRow = Array((4 * n)- 1) for (i=0; i<PascalRow.length ;i++ ) { var a=n*0.8 a =a*Math.sqrt(PascalRow[i]); PascalRow.splice(i, 1,a); } PascalRow.join(",") ```