The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A328202

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A328202

a(n) is the greatest common divisor of all the numbers in row n of Pascal's triangle excluding 1 and n.
(history; published version)

#40 by N. J. A. Sloane at Fri Oct 25 01:18:24 EDT 2019

STATUS

reviewed

approved

#39 by Michel Marcus at Fri Oct 25 00:45:14 EDT 2019

STATUS

proposed

reviewed

#38 by Robert Israel at Fri Oct 25 00:24:21 EDT 2019

STATUS

editing

proposed

#37 by Robert Israel at Fri Oct 25 00:21:31 EDT 2019

COMMENTS

If p is a Mersenne prime, a(p+1)>=2*p.

STATUS

proposed

editing

#36 by Robert Israel at Fri Oct 25 00:13:24 EDT 2019

STATUS

editing

proposed

#35 by Robert Israel at Fri Oct 25 00:13:10 EDT 2019

COMMENTS

If p is a Fermat prime, > 3, a(p)=2*(p).

If p is a Mersenne prime, a(p+1)>=2*(p).

#34 by N. J. A. Sloane at Thu Oct 24 11:31:43 EDT 2019

STATUS

proposed

editing

#33 by Joel Kaufmann at Thu Oct 24 08:17:10 EDT 2019

STATUS

editing

proposed

Discussion

Thu Oct 24

11:31

N. J. A. Sloane: I will R. Israel to look at this

#32 by Joel Kaufmann at Thu Oct 24 08:10:49 EDT 2019

COMMENTS

If p is a Fermat prime, a(p+1)>=2*(p+1).

If p is a Mersenne prime, a(p+1)>= 2*(p-1).

STATUS

approved

editing

Discussion

Thu Oct 24

08:17

Joel Kaufmann: I noticed that the comment by Robert Israel was wrong, probably due to a typo or something of the sort, because all that was incorrect was that when he wrote (p+1) or (p-1), it was suppposed to be (p) and when he wrote (p) it was supposed to be (p+1). I am pretty sure that I am correct on this however if I am incorrect or am just simply being stupid, please feel free to ignore this and send me a message.

#31 by N. J. A. Sloane at Wed Oct 16 12:12:01 EDT 2019

STATUS

proposed

approved