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-2 of 2 results.

A307508 Primes p for which the continued fraction expansion of sqrt(p) does not have a 1 in the second position.

Original entry on oeis.org

2, 5, 11, 17, 19, 29, 37, 41, 53, 67, 71, 83, 89, 101, 103, 107, 109, 127, 131, 149, 151, 173, 179, 181, 197, 199, 227, 229, 233, 239, 257, 263, 269, 271, 293, 331, 337, 367, 373, 379, 401, 409, 419, 443, 449, 457, 461, 487, 491, 499, 503, 541, 547, 577, 587, 593, 599
Offset: 1

Views

Author

Michel Marcus, Apr 11 2019

Keywords

Comments

These are the primes that are located between a square number and the following oblong number. - Charles Kusniec, Apr 17 2020
Primes in A063656. - Charles Kusniec, Sep 04 2022

Examples

			For p = 2,  we have [1; 2, ...]; see A040000.
For p = 5,  we have [2; 4, ...]; see A040002.
For p = 11, we have [3; 3, ...]; see A040007.
		

Crossrefs

Complement of A334163 with respect to the primes.

Programs

  • PARI
    isok(p) = isprime(p) && contfrac(sqrt(p))[2] != 1;

A307530 Primes p for which the continued fraction expansion of sqrt(p) has a single 1 starting at second position.

Original entry on oeis.org

3, 23, 47, 59, 61, 79, 97, 137, 139, 163, 167, 191, 193, 223, 251, 281, 283, 313, 317, 349, 353, 359, 389, 397, 431, 433, 439, 479, 521, 523, 563, 569, 571, 613, 617, 619, 659, 661, 673, 719, 727, 769, 773, 823, 827, 829, 839, 881, 883, 887, 941, 947, 953, 1009
Offset: 1

Views

Author

Michel Marcus, Apr 13 2019

Keywords

Comments

Misak and Ulas prove that the density of primes with k ones is 1/(Fibonacci(k+3)*Fibonacci(k+1)) = 1/3, here with k=1 (a single 1).

Examples

			For p = 3,  we have [1; 1, 2, ...]; see A040001.
For p = 27, we have [4; 1, 3, ...]; see A010127.
For p = 47, we have [6; 1, 5, ...]; see A010137.
		

Crossrefs

Programs

  • PARI
    isok(p) = my(cf = contfrac(sqrt(p))); (cf[2] == 1) && (cf[3] != 1);
    lista(nn) = forprime(p=2, nn, if (isok(p), print1(p, ", ")));
Showing 1-2 of 2 results.