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.

Previous Showing 11-13 of 13 results.

A325145 Primes not representable by cyclotomic binary forms.

Original entry on oeis.org

2, 23, 47, 59, 71, 83, 107, 131, 167, 179, 191, 227, 239, 251, 263, 311, 347, 359, 383, 419, 431, 443, 467, 479, 491, 503, 563, 587, 599, 647, 659, 719, 743, 827, 839, 863, 887, 911, 947, 971, 983, 1019, 1091, 1103, 1151, 1163, 1187, 1223
Offset: 1

Views

Author

Peter Luschny, May 16 2019

Keywords

Crossrefs

A325143 gives the primes represented by cyclotomic binary forms.

Programs

  • Julia
    [n for n in 1:1223 if isprime(ZZ(n)) && ! isA325143(n)] |> println

A325870 Primes represented by non-quadratic cyclotomic binary forms.

Original entry on oeis.org

11, 13, 17, 31, 43, 61, 73, 97, 127, 151, 181, 193, 211, 241, 257, 331, 337, 421, 461, 463, 521, 541, 547, 577, 601, 641, 683, 757, 881, 991, 1009, 1021, 1031, 1093, 1297, 1621, 1801, 1871, 1873, 1933, 2221, 2417, 2657, 2731, 2801, 3001, 3121, 3361, 3571, 3697
Offset: 1

Views

Author

Peter Luschny, May 26 2019

Keywords

Crossrefs

Programs

  • PARI
    isA325870(n) =
    {
        my(K, M, phi);
        K = floor(5.383*log(n)^1.161);
        M = floor(2*sqrt(n/3));
        for(k = 3, K,
            phi = eulerphi(k);
            if(phi >= 4,
                for(y = 1, M,
                    for(x = y + 1, M,
                        if(n == y^phi*polcyclo(k, x/y),
                            return(1)
        )))));
        return(0)
    }

Extensions

At the suggestion of Michel Waldschmidt

A300331 Integers represented by a cyclotomic binary form Phi{k}(x,y) with positive integers x and y where max(x, y) >= 2 and the index k is not prime.

Original entry on oeis.org

5, 8, 9, 10, 11, 16, 17, 18, 20, 25, 26, 29, 32, 34, 36, 40, 41, 45, 50, 53, 55, 58, 64, 65, 68, 72, 74, 81, 82, 85, 89, 90, 98, 100, 101, 104, 106, 113, 116, 122, 125, 128, 130, 136, 137, 144, 145, 146, 149, 153, 160, 162, 164, 170, 173, 176, 178, 180, 185
Offset: 1

Views

Author

Peter Luschny, Mar 06 2018

Keywords

Comments

A cyclotomic binary form is a homogeneous polynomial in two variables of the form p(x, y) = y^phi(k)*Phi(k, x/y) where Phi(k, z) is a cyclotomic polynomial of index k and phi is Euler's totient function. An integer m is represented by p if p(x,y) = m has an integer solution.
m is in this sequence if and only if m is in A296095 but not in A300332. This means m can be represented by a cyclotomic binary form but not as m = Sum_{j in 0:p-1} x^j*y^(p-j-1) with p prime.

Examples

			1037 is in this sequence because 1037 = f(26,19) = f(29,14) with f(x,y) = y^2 + x^2 are the only representations of 1037 by a cyclotomic binary form (which has index 4).
1031 is not in this sequence because 1031 = f(5,2) where f(x,y) = x^4 + y*x^3 + y^2*x^2 + y^3*x + y^4 (which has index 5).
		

Crossrefs

Programs

  • Julia
    using Nemo
    function isA300331(n)
        R, z = PolynomialRing(ZZ, "z")
        N = QQ(n)
        # Bounds from Fouvry & Levesque & Waldschmidt
        logn = log(n)^1.161
        K = Int(floor(5.383*logn))
        M = Int(floor(2*(n/3)^(1/2)))
        r = false
        k = 2
        while k <= K
            if k == 7
                K = Int(ceil(4.864*logn))
                M = Int(ceil(2*(n/11)^(1/4)))
            end
                e = Int(eulerphi(ZZ(k)))
                c = cyclotomic(k, z)
                for y in 2:M, x in 1:y
                    if N == y^e*subst(c, QQ(x, y))
                        isprime(ZZ(k)) && return false
                        r = true
                    end
                end
            k += 1
        end
        return r
    end
    A300331list(upto) = [n for n in 1:upto if isA300331(n)]
    println(A300331list(185))
Previous Showing 11-13 of 13 results.