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!)
A338779 a(n) is the smallest number k such that period of continued fraction for sqrt(prime(j)) equal for all prime(k) <= prime(j) < prime(k + n). 0
1, 97, 141043 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The corresponding primes are 2, 509, 1885717, ...
LINKS
EXAMPLE
sqrt(prime(97)) = sqrt(509) has continued fraction [22; 1, 1, 3, 1, 1, 2, 10, 1, 8, 8, 1, 10, 2, 1, 1, 3, 1, 1, 44, ...], period 19.
sqrt(prime(98)) = sqrt(521) has continued fraction [22; 1, 4, 1, 2, 1, 2, 8, 1, 3, 3, 1, 8, 2, 1, 2, 1, 4, 1, 44, ...], period 19.
These are the first 2 consecutive primes with the same period of continued fraction for square root, so a(2) = 97.
MATHEMATICA
A054269[n_] := Module[{s = Sqrt[Prime[n]]}, If[IntegerQ[s], 0, Length[ContinuedFraction[s][[2]]]]]; Do[find = 0; k = 0; While[find == 0, k++; If[Length[Union[Table[A054269[j], {j, k, k + n - 1}]]] == 1, find = 1; Print[k]]], {n, 1, 3}]
CROSSREFS
Sequence in context: A160489 A220982 A193825 * A209475 A186167 A322606
KEYWORD
nonn,bref,more
AUTHOR
Ilya Gutkovskiy, Nov 08 2020
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 May 31 19:57 EDT 2024. Contains 373003 sequences. (Running on oeis4.)