The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A360077 Odd numbers k such that k mod (k-s) = 1, where s is the greatest square < k. 0
3, 7, 11, 13, 19, 21, 27, 29, 31, 33, 41, 43, 51, 53, 55, 57, 61, 67, 71, 73, 83, 85, 89, 91, 97, 103, 109, 111, 123, 125, 127, 129, 131, 133, 141, 155, 157, 171, 173, 175, 177, 181, 183, 193, 199, 201, 209, 211, 227, 229, 233, 239, 241, 253, 259, 261, 271, 273, 291 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Sequence contains no terms from A002522. Curiously, the asymptotic density of prime terms appears to be ~ 2n/log(n).
LINKS
EXAMPLE
Let k = 3; q = 3 - 1^2 = 2 and 3 mod 2 = 1, so 3 is a term.
Let k = 5; q = 5 - 2^2 = 1 and 5 mod 1 != 1, so 5 is not a term.
Let k = 53; q = 53 - 7^2 = 4 and 53 mod 4 = 1, so 53 is a term.
MATHEMATICA
q[n_] := Module[{s = Floor[Sqrt[n - 1]]^2}, Mod[n, n - s] == 1]; Select[Range[1, 300, 2], q] (* Amiram Eldar, Jan 26 2023 *)
PROG
(PARI) is(n)=if(n%2!=0, my(z); sqrtint(n, &z); z>0&&n%z==1);
CROSSREFS
Sequence in context: A045418 A257057 A310197 * A090456 A070303 A256863
KEYWORD
nonn
AUTHOR
Bill McEachen, Jan 24 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 03:48 EDT 2024. Contains 373054 sequences. (Running on oeis4.)