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.

A057949 Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.

Original entry on oeis.org

441, 693, 1089, 1197, 1449, 1617, 1881, 1953, 2205, 2277, 2541, 2709, 2793, 2961, 3069, 3249, 3381, 3465, 3717, 3933, 3969, 4221, 4257, 4389, 4473, 4557, 4653, 4761, 4977, 5229, 5301, 5313, 5445, 5733, 5841, 5929, 5985, 6237, 6321, 6417, 6489, 6633
Offset: 1

Views

Author

Jud McCranie, Oct 14 2000

Keywords

Comments

Numbers with k >= 4 prime factors (with multiplicity) that are congruent to 3 mod 4, no k-1 of which are equal. - Charlie Neder, Nov 03 2018

Examples

			2205 is in S = {1,5,9, ... 4i+1, ...}, 2205 = 5*9*49 = 5*21^2; 5, 9, 21 and 49 are S-primes (A057948).
		

Crossrefs

Cf. A343826 (only 1 way), A343827 (exactly 2 ways), A343828 (exactly 3 ways).

Programs

  • PARI
    ok(n)={if(n%4==1, my(f=factor(n)); my(s=[f[i,2] | i<-[1..#f~], f[i,1]%4==3]); vecsum(s)>=4 && vecmax(s)Andrew Howroyd, Nov 25 2018
  • Sage
    def A057949_list(bound) :
        numterms = (bound-1)//4 + 1
        M = [1] * numterms
        for k in range(1, numterms) :
            if M[k] == 1 :
                kpower = k
                while kpower < numterms :
                    step = 4*kpower+1
                    for j in range(kpower, numterms, step) :
                        M[j] *= 4*k+1
                    kpower = 4*kpower*k + kpower + k
        # Now M[k] contains the product of the terms p^e where p is an S-prime
        # and e is maximal such that p^e divides 4*k+1
        return [4*k+1 for k in range(numterms) if M[k] > 4*k+1]
    # Eric M. Schmidt, Dec 11 2016
    

Extensions

Offset corrected by Eric M. Schmidt, Dec 11 2016

A343826 Numbers which are the product of two S-primes (A057948) in exactly one way.

Original entry on oeis.org

25, 45, 65, 81, 85, 105, 117, 145, 153, 165, 169, 185, 189, 205, 221, 245, 261, 265, 273, 285, 289, 297, 305, 333, 345, 357, 365, 369, 377, 385, 429, 445, 465, 477, 481, 485, 493, 505, 513, 533, 545, 549, 561, 565, 605, 609, 621, 629, 637, 645, 657, 665, 685
Offset: 1

Views

Author

Zachary DeStefano, Apr 30 2021

Keywords

Comments

There exist numbers which are the product of two S-primes in exactly 1, 2, and 3 ways; however, it is unknown if any numbers exist which are the product of two S-primes in exactly 4 ways.

Examples

			153 = 9*17 which are both S-primes, and admits no other S-prime factorizations.
		

Crossrefs

Exactly two ways: A343827. Exactly three ways: A343828.

Programs

  • PARI
    \\ uses is(n) from A057948
    isok(n) = sumdiv(n, d, (d<=n/d) && is(d) && is(n/d)) == 1; \\ Michel Marcus, May 01 2021

Formula

a(n) == 1 (mod 4). - Hugo Pfoertner, May 01 2021

A343828 Numbers which are the product of two S-primes (A057948) in exactly three ways.

Original entry on oeis.org

4389, 5313, 7161, 9177, 9933, 10857, 12369, 13629, 14421, 14973, 15477, 16401, 17157, 18249, 18753, 19173, 19437, 20769, 22701, 23529, 23541, 23793, 24717, 26733, 26961, 27993, 28329, 28497, 29337, 29469, 30261, 30597, 31521, 32109, 32361, 32637, 33117, 33649
Offset: 1

Views

Author

Zachary DeStefano, Apr 30 2021

Keywords

Comments

There exist numbers which are the product of two S-primes in exactly 1, 2, and 3 ways.
An S-prime is either a prime of the form 4k+1 or a semiprime of the form (4k+3)*(4m+3). That means the maximum number of prime factors that a number factorizable into two S-primes can have is four (all 4k + 3), and those can be combined into S-primes in at most three distinct ways. - Gleb Ivanov, Dec 07 2021

Examples

			9177 = 21*437 = 57*161 = 69*133 which are all S-primes (A057948), and admits no other S-Prime factorizations.
4389 = (3*7)*(11*19) = (3*11)*(7*19) = (3*19)*(7*11); 3,7,11,19 are the smallest primes of the form 4k + 3.
		

Crossrefs

Exactly one way: A343826. Exactly two ways: A343827.

Programs

  • PARI
    \\ uses is(n) from A057948
    isok(n) = sumdiv(n, d, (d<=n/d) && is(d) && is(n/d)) == 3; \\ Michel Marcus, May 01 2021

Formula

a(n) == 1 (mod 4). - Hugo Pfoertner, May 01 2021
Showing 1-3 of 3 results.