cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A031401 Period of continued fraction for sqrt(A031400(n)).

Original entry on oeis.org

1, 2, 4, 8, 4, 4, 4, 4, 4, 4, 4
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A031400.

Extensions

a(10)-a(11) from Chai Wah Wu, Jan 26 2021

A288186 Numbers k such that the continued fractions for sqrt(k) and sqrt(k+1) have the same period.

Original entry on oeis.org

11, 21, 32, 33, 38, 39, 78, 83, 91, 95, 104, 111, 115, 140, 141, 146, 147, 161, 164, 204, 205, 206, 219, 222, 227, 230, 242, 245, 299, 310, 320, 321, 326, 327, 340, 344, 371, 383, 395, 404, 413, 428, 434, 438, 443, 447, 451, 452, 464, 471, 498, 504, 515, 539, 545, 572, 573, 578, 579, 594, 596, 644, 654, 659, 695
Offset: 1

Views

Author

Ilya Gutkovskiy, Jun 06 2017

Keywords

Comments

Numbers k such that A003285(k) = A003285(k+1).

Examples

			11 is in the sequence because sqrt(11) = 3 + 1/(3 + 1/(6 + 1/(3 + 1/(6 + 1/...)))), period 2: [3, 6] and sqrt(12) = 3 + 1/(2 + 1/(6 + 1/(2 + 1/(6 + 1/...)))), period  2: [2, 6].
		

Crossrefs

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).

Original entry on oeis.org

1, 97, 141043
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 08 2020

Keywords

Comments

The corresponding primes are 2, 509, 1885717, ...

Examples

			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.
		

Crossrefs

Programs

  • 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}]
Showing 1-3 of 3 results.