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

Alonso Del Arte alonso.delarte at gmail.com
Thu Dec 29 17:36:14 CET 2016


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>


More information about the SeqFan mailing list