The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A309397

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

A309397

a(n) = gcd(n^2, A001008(n-1)) for n > 1.
(history; published version)

#29 by Joerg Arndt at Sun Oct 23 11:55:11 EDT 2022

STATUS

reviewed

approved

#28 by Amiram Eldar at Sun Oct 23 11:43:51 EDT 2022

STATUS

proposed

reviewed

#27 by Michel Marcus at Sun Oct 23 11:43:01 EDT 2022

STATUS

editing

proposed

#26 by Michel Marcus at Sun Oct 23 11:42:59 EDT 2022

LINKS

R. Meštrović, <a href="https://arxiv.org/abs/1111.3057">Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862--2012)</a>, arXiv:1111.3057 [math.NT], 20012011.

STATUS

approved

editing

#25 by Charles R Greathouse IV at Thu Sep 08 08:46:21 EDT 2022

PROG

(MAGMAMagma) [Gcd(k^2, Numerator(HarmonicNumber(k-1))):k in [2..80]]; // Marius A. Burtea, Jul 28 2019

Discussion

Thu Sep 08

08:46

OEIS Server: https://oeis.org/edit/global/2944

#24 by N. J. A. Sloane at Wed Jul 31 21:58:20 EDT 2019

STATUS

proposed

approved

#23 by Chai Wah Wu at Wed Jul 31 21:23:00 EDT 2019

STATUS

editing

proposed

#22 by Chai Wah Wu at Wed Jul 31 21:22:51 EDT 2019

PROG

return gcd(n**2, harmonic(n-1).p) # Chai Wah Wu, Jul 31 2019

#21 by Chai Wah Wu at Wed Jul 31 21:22:42 EDT 2019

PROG

(Python)

from sympy import gcd, harmonic

def A309387(n):

return gcd(n**2, harmonic(n-1).p) # Chai Wah Wu, Jul 31 2019

STATUS

approved

editing

#20 by Alois P. Heinz at Wed Jul 31 18:12:49 EDT 2019

STATUS

reviewed

approved