A134600 -id:A134600 - cp's OEIS frontend

A134605 Composite numbers such that the square root of the sum of squares of their prime factors (with multiplicity) is an integer.

16, 48, 81, 320, 351, 486, 512, 625, 1080, 1260, 1350, 1375, 1792, 1836, 2070, 2145, 2175, 2401, 2730, 2772, 3072, 3150, 3510, 4104, 4305, 4625, 4650, 4655, 4998, 5880, 6000, 6174, 6545, 7098, 7128, 7182, 7650, 7791, 7889, 7956, 9030, 9108, 9295, 9324

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(2)=48 since 48=2*2*2*2*3 and sqrt(4*2^2+3^2)=sqrt(25)=5.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376, A134600, A134602, A134608, A134611, A134616, A134618, A134620.

srssQ[n_]:=IntegerQ[Sqrt[Total[Flatten[Table[#[[1]],#[[2]]]&/@ FactorInteger[ n]]^2]]]; Select[Range[10000],CompositeQ[#]&&srssQ[#]&] (* Harvey P. Dale, Jan 22 2019 *)

is(n)=my(f=factor(n)); issquare(sum(i=1,#f~,f[i,1]^2*f[i,2])) && !isprime(n) && n>1 \\ Charles R Greathouse IV, Apr 29 2015

A134608 Composite numbers such that the cube root of the sum of cubes of their prime factors is an integer.

Original entry on oeis.org

256, 588, 693, 3840, 6561, 14157, 17787, 141960, 178360, 313600, 337365, 350000, 387072, 390625, 407442, 432000, 466560, 531674, 535815, 541310, 664909, 697851, 1044582, 1262056, 1264640, 1299272, 1374327, 1547570, 1608575, 1660360

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(3)=693, since 693=3*3*7*11 and (2*3^3+7^3+11^3)^(1/3)=1728^(1/3)=12.

Hieronymus Fischer, Table of n, a(n) for n = 1..300

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134611, A134616, A134618, A134620.

criQ[n_]:=IntegerQ[Surd[Total[Flatten[Table[#[[1]],#[[2]]]&/@ FactorInteger[ n]]^3],3]]; Select[Range[1670000],CompositeQ[#] && criQ[#]&] (* Harvey P. Dale, Sep 19 2021 *)

lista(m) = {for (i=2, m, if (! isprime(i), f = factor(i); s = sum (j=1, length(f~), f[j,1]^3*f[j,2]); if (ispower(s, 3), print1(i, ", "));););} \\ Michel Marcus, Apr 14 2013

Minor edits by Hieronymus Fischer, Apr 20 2013

A090677 Number of ways to partition n into sums of squares of primes.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 2, 2, 2, 4, 3, 2, 3, 4, 4, 2, 3, 4, 5, 3, 3, 5, 5, 4, 3, 5, 5, 5, 4, 5, 6, 5, 5, 5, 7, 6, 6, 6, 7, 7, 6, 7, 7, 8, 7, 8, 8, 8, 8, 8, 9, 8, 9, 9, 10, 9, 9, 10, 11, 11, 10, 11

Offset: 0

N. J. A. Sloane, Dec 19 2003

nonn

From Hieronymus Fischer, Nov 11 2007: (Start)
First statement of monotony: a(n+p^2)>=a(n) for all primes p. Proof: we restrict ourselves on a(n)>0 (the case a(n)=0 is trivial). Let T(i), 1<=i<=a(n), be the a(n) different sums of squares of primes representing n. Then, adding p^2 to those expressions, we get a(n) sums of squares of primes T(i)+p^2, obviously representing n+p^2, thus a(n+p^2) cannot be less than a(n).
Second statement of monotony: a(n+m)>=max(a(n),a(m)) for all m with a(m)>1. Proof: let T(i), 1<=i<=a(n), be the a(n) different sums of squares of primes representing n; let S(i), 1<=i<=a(m), be the a(m) different sums of squares of primes representing m. Then, adding these expressions, we get a(n) sums of squares of primes T(i)+S(1), representing n+m, further we get a(m) sums T(1)+S(i), also representing n+m. Thus a(n+m) cannot be less than the maximum of a(n) and a(m).
The minimum b(k):=min( n | a(j)>k for all j>n) exists for all k>=0. See A134755 for that sequence representing b(k). (End)

			a(25)=2 because 25 = 5^2 = 4*(2^2)+3^2.
a(83)=8 because 83 = 3^2+5^2+7^2 = 4*(2^2)+2*(3^2)+7^2
                   = 2*(2^2)+3*(5^2) = 6*(2^2)+3^2+2*(5^2)
                   = 2^2+6*(3^2)+5^2 = 10*(2^2)+2*(3^2)+5^2
                   = 5*(2^2)+7*(3^2) = 14*(2^2)+3*(3^2).

R. F. Churchouse, Representation of integers as sums of squares of primes. Caribbean J. Math. 5 (1986), no. 2, 59-65.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Christian N. K. Anderson, Table of coefficients b_i solving n=sum(b_i * prime(i)^2), for n=0..500
Roger Woodford, Bounds for the Eventual Positivity of Difference Functions of Partitions, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.3.

Cf. A111900, A001248, A001156, A023893, A111901.

Cf. A078134, A078135, A078136, A078139, A134600, A078137, A134754, A134755.

CoefficientList[ Series[ Product[1/(1 - x^Prime[i]^2), {i, 111}], {x, 0, 101}], x] (* Robert G. Wilson v, Sep 20 2004 *)

G.f.: 1/((1-x^4)*(1-x^9)*(1-x^25)*(1-x^49)*(1-x^121)*(1-x^169)*(1-x^289)...).

G.f.: 1 + Sum_{i>=1} x^(prime(i)^2) / Product_{j=1..i} (1 - x^(prime(j)^2)). - Ilya Gutkovskiy, May 07 2017

A134602 Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).

Original entry on oeis.org

378, 455, 527, 918, 1265, 1615, 2047, 2145, 2175, 2345, 2665, 3713, 3835, 4207, 4305, 4633, 5000, 5117, 5382, 6061, 6678, 6887, 6965, 7055, 7267, 7327, 7497, 7685, 7791, 8470, 8785, 8918, 9641, 10205, 10545, 10647, 11137, 11543, 11713, 13482, 14079

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

Numbers included in A134600, but not in A134601. a(1)=378 is the minimal number with this property.

Also numbers included in A134603, but not in A134604.

			a(2)=455, since 455=5*7*13 and sqrt((5^2+7^2+13^2)/3)=sqrt(81)=9.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134604, A134608, A134611, A134617, A134619, A134621.

f[{a_,b_}]:=Table[a,b];Select[Range[2,14079],!PrimeQ[#]&&!PrimeQ[ RootMeanSquare[f/@FactorInteger[#]//Flatten] ]&&IntegerQ[ RootMeanSquare[f/@FactorInteger[#]//Flatten] ]&] (* James C. McMahon, Apr 08 2025 *)

Definition clarified by Hieronymus Fischer, Apr 20 2013, Jun 01 2013

A134621 Numbers such that the arithmetic mean of the 4th power of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

15, 28, 39, 48, 51, 65, 68, 76, 77, 85, 87, 93, 111, 119, 133, 141, 143, 148, 155, 161, 175, 187, 189, 209, 212, 215, 221, 225, 235, 244, 275, 287, 295, 301, 315, 316, 320, 323, 329, 355, 393, 403, 404, 411, 428, 437, 447, 451, 455, 481, 505, 508, 515, 517

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(3)=39, since 39=3*13 and (3^4+13^4)/2=14321 which is prime.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134613, A134617, A134619.

Minor edits by Hieronymus Fischer, May 06 2013

A134619 Numbers such that the arithmetic mean of the cubes of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

20, 44, 188, 297, 336, 400, 425, 540, 575, 605, 704, 752, 764, 908, 912, 1025, 1053, 1124, 1172, 1183, 1365, 1380, 1412, 1420, 1452, 1475, 1484, 1519, 1604, 1625, 1809, 1844, 1856, 1936, 1953, 2107, 2192, 2205, 2255, 2320, 2325, 2348, 2368, 2372, 2468

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(10)=605, since 605=5*11*11 and (5^3+11^3+11^3)/3=929 which is prime.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134613, A134617, A134621.

amcpfQ[n_]:=PrimeQ[Mean[Flatten[PadRight[{},#[[2]],#[[1]]]&/@FactorInteger[n]]^3]]; Select[ Range[ 2500],amcpfQ] (* Harvey P. Dale, Jun 06 2023 *)

lista(m) = {for (i=2, m, f = factor(i); s = sum (j=1, length(f~), f[j,1]^3*f[j,2]); s /= bigomega(i); if (type(s) == "t_INT" && isprime(s), print1(i, ", ")););} \\ Michel Marcus, Apr 14 2013

Minor edits by Hieronymus Fischer, May 06 2013

A134611 Nonprime numbers such that the root mean cube of their prime factors is an integer (where the root mean cube of c and d is ((c^3+d^3)/2)^(1/3)).

Original entry on oeis.org

1, 4, 8, 9, 16, 25, 27, 32, 49, 64, 81, 121, 125, 128, 169, 243, 256, 289, 343, 361, 512, 529, 625, 729, 841, 961, 1024, 1331, 1369, 1512, 1681, 1849, 2048, 2187, 2197, 2209, 2401, 2809, 3125, 3481, 3721, 4096, 4489, 4913, 5041, 5329, 6241, 6561, 6859, 6889

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

The prime factors are taken with multiplicity.
All perfect prime powers (A025475) are included. First term not included in A025475 is a(30) = 1512 = A134613(2) = A134613(1).
Most terms have a last digit of 1 or 9 (i.e., 8326 out of 9000 terms). Mainly, this comes from the fact that all squares of primes are included. Since each prime > 10 has a last digit of 1, 3, 7 or 9, its square has a last digit of 1 or 9. In addition, m-th powers of primes have a last digit of 1, if m == 0 (mod 4), and have a last digit of 1 or 9 if m == 2 (mod 4), and have a 50% chance, roughly, for a last digit of 1 or 9, if m == 1 (mod 4) or m == 3 (mod 4). Since the number of terms <= N which are squares of primes is PrimePi(sqrt(N)) = A000720(sqrt(N)), it follows that the number of terms <= N which have a last digit of 1 or 9 is greater than PrimePi(sqrt(N)). This can be estimated as 2*N^(1/2)/log(N), approximately.

			a(6) = 25, since 25 = 5*5 and ((5^3+5^3)/2)^(1/3) = 5.
a(30) = 1512, since 1512 = 2*2*2*3*3*3*7 and ((3*2^3+3*3^3+7^3)/7)^(1/3) = 64^(1/3) = 4.

Hieronymus Fischer, Table of n, a(n) for n = 1..9000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134617, A134619, A134621.

lista(m) = {for (i=2, m, if (! isprime(i), f = factor(i); s = sum (j=1, length(f~), f[j,1]^3*f[j,2]); s /= bigomega(i); if (type(s) == "t_INT" && ispower(s, 3), print1(i, ", "));););}  \\ Michel Marcus, Apr 14 2013

Edited by Hieronymus Fischer, May 30 2013

A078137 Numbers which can be written as sum of squares>1.

Original entry on oeis.org

4, 8, 9, 12, 13, 16, 17, 18, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82

Offset: 1

Reinhard Zumkeller, Nov 19 2002

A078134(a(n))>0.
Numbers which can be written as a sum of squares of primes. - Hieronymus Fischer, Nov 11 2007
Equivalently, numbers which can be written as a sum of squares of 2 and 3. Proof for numbers m>=24: if m=4*(k+6), k>=0, then m=(k+6)*2^2; if m=4*(k+6)+1 than m=(k+4)*2^2+3^2; if m=4*(k+6)+2 then m=(k+2)*2^2+2*3^2; if m=4*(k+6)+3 then m=k*2^2+3*3^2. Clearly, the numbers a(n)<24 can also be written as sums of squares of 2 and 3. Explicit representation as a sum of squares of 2 and 3 for numbers m>23: m=c*2^2+d*3^2, where c:=(floor(m/4) - 2*(m mod 4))>=0 and d:=m mod 4. - Hieronymus Fischer, Nov 11 2007

Index entries for sequences related to sums of squares
Eric Weisstein's World of Mathematics, Square Number.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Complement of A078135.

Cf. A000290, A078136, A078131, A001597, A025475, A078134, A078135, A078139, A090677, A134600, A134605, A134608, A134612, A134616, A134618, A134620.

Join[{4, 8, 9, 12, 13, 16, 17, 18, 20, 21, 22}, Range[24, 82]] (* Jean-François Alcover, Aug 01 2018 *)

a(n)=if(n>11,n+12,[4,8,9,12,13,16,17,18,20,21,22][n]) \\ Charles R Greathouse IV, Aug 21 2011

a(n)=n + 12 for n >= 12. - Hieronymus Fischer, Nov 11 2007

Edited by N. J. A. Sloane, Oct 17 2009 at the suggestion of R. J. Mathar.

A134617 Numbers such that the arithmetic mean of the squares of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

15, 20, 21, 28, 35, 39, 44, 48, 51, 52, 55, 65, 69, 85, 91, 92, 95, 108, 112, 115, 116, 129, 135, 141, 145, 159, 164, 172, 188, 189, 205, 208, 209, 215, 221, 225, 235, 236, 245, 249, 259, 268, 272, 295, 297, 299, 305, 309, 315, 316, 320, 325, 329, 339, 341, 365

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(2)=20, since 20=2*2*5 and (2^2+2^2+5^2)/3=33/3=11.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134613, A134619, A134621.

amspQ[n_]:=PrimeQ[Mean[Flatten[Table[#[[1]],#[[2]]]&/@FactorInteger[ n]]^2]]; Select[Range[400],amspQ] (* Harvey P. Dale, Jan 21 2017 *)

Minor edits by the author, May 06 2013

A134616 Numbers such that the sum of squares of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

6, 10, 12, 14, 26, 34, 40, 45, 54, 56, 63, 74, 75, 80, 90, 94, 96, 99, 104, 105, 126, 134, 146, 147, 152, 153, 171, 176, 184, 194, 206, 207, 231, 232, 234, 250, 261, 273, 274, 296, 300, 306, 326, 328, 334, 342, 344, 345, 350, 357, 363, 369, 376, 384, 386, 387

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(2)=10, since 10=2*5 and 2^2+5^2=29 which is prime.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134612, A134619, A134621.

f[{a_,b_}]:=Table[a,b];Select[Range[2,387],PrimeQ[ Total[Flatten[(f/@FactorInteger[#])^2]] ]&] (* James C. McMahon, Apr 09 2025 *)

Minor edits by the author, May 06 2013

cp's OEIS Frontend

A134605 Composite numbers such that the square root of the sum of squares of their prime factors (with multiplicity) is an integer.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A134608 Composite numbers such that the cube root of the sum of cubes of their prime factors is an integer.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A090677 Number of ways to partition n into sums of squares of primes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A134602 Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A134621 Numbers such that the arithmetic mean of the 4th power of their prime factors (taken with multiplicity) is a prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

A134619 Numbers such that the arithmetic mean of the cubes of their prime factors (taken with multiplicity) is a prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A134611 Nonprime numbers such that the root mean cube of their prime factors is an integer (where the root mean cube of c and d is ((c^3+d^3)/2)^(1/3)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A078137 Numbers which can be written as sum of squares>1.

Views

Author

Keywords

Comments