# [seqfan] Re: Number of appearances of a number in Pascal's triangle compared to its divisors

Max Alekseyev maxale at gmail.com
Wed Jan 4 00:54:33 CET 2017

```Some counterexamples:
A003016(12) = 2 < 3 = A003016(6),
A003016(63) = 2 < 4 = A003016(21).

Regards,
Max

On Thu, Dec 29, 2016 at 11:36 AM, Alonso Del Arte <alonso.delarte at gmail.com>
wrote:

> As you know, 1 appears infinitely often in Pascal's triangle, while 2
> appears just once. Each odd prime appears just twice.
>
> But what about composite numbers? Does every composite number appear more
> often than any of its nontrivial divisors? This would seem to be true for
> even numbers greater than 2. At least it seems like powers of odd primes
> appear only twice each.
>
> The sequence I'm looking for seems to be A235868. Any thoughts?
> Counterexamples?
>
> Al
>
> --
> Alonso del Arte
> Author at SmashWords.com
> <https://www.smashwords.com/profile/view/AlonsoDelarte>
> Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>
```