### A common generalization of some identities.

Zhang, Zhizheng, Wang, Jun (2005)

Integers

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Zhang, Zhizheng, Wang, Jun (2005)

Integers

Similarity:

Naranjani, Lila, Mirzavaziri, Madjid (2011)

Journal of Integer Sequences [electronic only]

Similarity:

Sun, Zhiwei (2002)

Integers

Similarity:

Isgur, Abraham, Rahman, Mustazee (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Duffus, Dwight, Sands, Bill (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)

Journal of Integer Sequences [electronic only]

Similarity:

Tripathi, Amitabha (2006)

Integers

Similarity:

Uchida, Yasuharu (2008)

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Similarity:

Veneziani, Pierangela (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Lv, Lun, Xin, Guoce, Zhou, Yue (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Okoroafor, A.Chukwuemeka (2007)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Izumino, Saichi, Pečarić, Josip E., Tepeš, Božidar (2005)

Journal of Inequalities and Applications [electronic only]

Similarity:

Ligia Cristea, Helmut Prodinger (2013)

Open Mathematics

Similarity:

We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics...