The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A362502

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

A362502

Least k > 0 such that (floor(sqrt(n*k)) + 1)^2 mod n is a square.
(history; published version)

#36 by OEIS Server at Mon May 29 00:08:27 EDT 2023

LINKS

Winston de Greef, <a href="/A362502/b362502_1.txt">Table of n, a(n) for n = 1..10000</a>

#35 by Michael De Vlieger at Mon May 29 00:08:27 EDT 2023

STATUS

reviewed

approved

Discussion

Mon May 29

00:08

OEIS Server: Installed first b-file as b362502.txt.

#34 by Andrew Howroyd at Sun May 28 23:05:37 EDT 2023

STATUS

proposed

reviewed

#33 by Winston de Greef at Sun May 28 17:21:42 EDT 2023

STATUS

editing

proposed

#32 by Winston de Greef at Sun May 28 17:18:52 EDT 2023

LINKS

Winston de Greef, <a href="/A362502/b362502_1.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#31 by Michael De Vlieger at Wed May 24 07:34:01 EDT 2023

STATUS

reviewed

approved

#30 by Kevin Ryde at Wed May 24 01:21:49 EDT 2023

STATUS

proposed

reviewed

#29 by Jon E. Schoenfield at Mon Apr 24 19:35:27 EDT 2023

STATUS

editing

proposed

Discussion

Tue Apr 25

02:15

Kevin Ryde: Since n*k == 0 mod n, you could think about it as distance to next greater square has to be multiple of n.

05:11

Kevin Ryde: Oh, I confused myself there: distance to next square, after the mod n, has to be a square ...

11:07

Darío Clavijo: Please go on

#28 by Jon E. Schoenfield at Mon Apr 24 19:35:22 EDT 2023

NAME

Least k > 0 such that (floor(sqrt(n*k)) + 1)^2 mod n is a square.

STATUS

proposed

editing

#27 by Stefano Spezia at Mon Apr 24 15:52:14 EDT 2023

STATUS

editing

proposed