|
%I #23 May 27 2021 17:16:19
%S 441,693,1089,1197,1449,1617,1881,1953,2205,2277,2541,2709,2793,2961,
%T 3069,3249,3381,3465,3717,3933,3969,4221,4257,4389,4473,4557,4653,
%U 4761,4977,5229,5301,5313,5445,5733,5841,5929,5985,6237,6321,6417,6489,6633
%N Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.
%C 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
%H Eric M. Schmidt, <a href="/A057949/b057949.txt">Table of n, a(n) for n = 1..10000</a>
%e 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).
%o (Sage)
%o def A057949_list(bound) :
%o numterms = (bound-1)//4 + 1
%o M = [1] * numterms
%o for k in range(1, numterms) :
%o if M[k] == 1 :
%o kpower = k
%o while kpower < numterms :
%o step = 4*kpower+1
%o for j in range(kpower, numterms, step) :
%o M[j] *= 4*k+1
%o kpower = 4*kpower*k + kpower + k
%o # Now M[k] contains the product of the terms p^e where p is an S-prime
%o # and e is maximal such that p^e divides 4*k+1
%o return [4*k+1 for k in range(numterms) if M[k] > 4*k+1]
%o # _Eric M. Schmidt_, Dec 11 2016
%o (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)<vecsum(s)-1, 0)} \\ _Andrew Howroyd_, Nov 25 2018
%Y Cf. A054520, A057948, A057950.
%Y Cf. A343826 (only 1 way), A343827 (exactly 2 ways), A343828 (exactly 3 ways).
%K nonn
%O 1,1
%A _Jud McCranie_, Oct 14 2000
%E Offset corrected by _Eric M. Schmidt_, Dec 11 2016
|
