Pterolophia obliquata Breuning & de Jong, 1941




We’re sorry, but GBIF doesn’t work properly without JavaScript enabled.

Our website has detected that you are using an outdated insecure browser that will prevent you from using the site. We suggest you upgrade to a modern browser.


















{{nav.loginGreeting}}
























































window.gb = window.gb || {};
window.gb.locale = 'en';

window.gb.urlPrefix = '';
window.gb.buildVersion = '1544642351794';

-

Popular posts from this blog

Nagoyas tunnelbana

Image
Tunnelbanetåg av typ 3050 på Kami Otai Station Nagoyas tunnelbana ( 名古屋市営地下鉄 , Nagoya-shiei chikatetsu ? ) är tunnelbanesystemet i Nagoya, Aichi, Japan. Det består av 5 linjer med en sammanlagd längd av 89 km och har 93 stationer. [ 1 ] Den är en ren stadsbana och alla stationer ligger inom Nagoya stadsgränser, undantaget Akaike som ligger i Nisshin. Trafik till kranskommunerna sker med ett antal andra anslutande tåglinjer som drivs av olika bolag. Tunnelbanan är hopbyggd med Meitetsus järnvägsnät på några stationer och har därigenom trafik till Inuyama och Toyota. Tunnelbanan drivs av det kommunala Transportation Bureau City of Nagoya . Innehåll 1 Historia 2 Linjer 2.1 Higashiyamalinjen 2.2 Meijo- och Meikolinjerna 2.3 Sakura-dorilinjen 2.4 Tsurumailinjen 3 Säkerhet 4 Externa länkar 5 Källor Historia | Nagoya har tidigare haft ett spårvägsystem som öppnades i privat regi 1898 men som senare köptes upp av staden 1922. [ 2 ...
Read more

Partitioning a multiset into multisets of fixed sizes

Image
3 $begingroup$ Say we have a multiset $S(mathbf{d}$) where $mathbf{d}$ is a list of $l$ numbers and the multiplicity of the $i$th element of $S$ is $d_i$. The cardinality $N$ of $S$ is $sum d_i$. We want to partition $S$ into $m$ multisets of size $k_i$ respectively, so that $sum k_i = sum d_i = N$. How many ways can we do this? In my mind this is a generalization of the multinomial coefficient $binom{n}{k_1,k_2,ldots,k_m}$ representing the number of ways to partition a set of $n=sum k_i$ objects into $m$ bins of sizes $k_i$, to a sort of number like $binom{mathbf{d}}{k_1,k_2,ldots,k_m}$ or $binom{mathbf{d}}{mathbf{k}}$ representing the number of ways to partition a multiset of $n=sum k_i = sum d_i$ into $m$ bins of sizes $k_i$. There are a few special cases that are simpler to calculate: If $m=1$, then cl...
Read more

File:Switzerland Bern City 1930 revenue 10Fr - 77B.jpg

Image
File:Switzerland Bern City 1930 revenue 10Fr - 77B.jpg From Wikipedia, the free encyclopedia Jump to navigation Jump to search File File history File usage Metadata Size of this preview: 489 × 599 pixels. Other resolutions: 196 × 240 pixels | 392 × 480 pixels | 490 × 600 pixels | 826 × 1,012 pixels. Original file ‎ (826 × 1,012 pixels, file size: 459 KB, MIME type: image/jpeg ) This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. Summary Description Switzerland Bern City 1930 revenue 10Fr - 77B.jpg English: Switzerland Bern City 1930 revenue 10Fr - 77B. Stadtkanzlei (chancellery). Date 1930 Source Self-scanned Author Government of Bern-City (Switzerland) Licensing Public domain Public domain false false This work is in the public domain in its country of...
Read more