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

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

Views

Author

Reinhard Zumkeller, Nov 19 2002

Keywords

Comments

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

Crossrefs

Programs

Formula

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

Extensions

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

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

Views

Author

Hieronymus Fischer, Nov 11 2007

Keywords

Examples

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

Crossrefs

Programs

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

Extensions

Minor edits by the author, May 06 2013

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

Original entry on oeis.org

12, 28, 40, 45, 48, 52, 54, 56, 63, 75, 80, 96, 104, 108, 117, 136, 152, 153, 165, 175, 210, 224, 232, 245, 250, 261, 268, 300, 320, 325, 333, 344, 350, 363, 384, 387, 390, 399, 405, 416, 432, 462, 464, 468, 475, 477, 504, 507, 531, 536, 539, 561, 570, 584
Offset: 1

Views

Author

Hieronymus Fischer, Nov 11 2007

Keywords

Examples

			a(2) = 28, since 28 = 2*2*7 and 2^3 + 2^3 + 7^3 = 359 which is prime.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[600],PrimeQ[Total[Flatten[Table[#[[1]],{#[[2]]}]&/@ FactorInteger[#]]^3]]&] (* Harvey P. Dale, Feb 01 2013 *)
  • Python
    from sympy import factorint, isprime
    def ok(n): return isprime(sum(p**3 for p in factorint(n, multiple=True)))
    print([k for k in range(585) if ok(k)]) # Michael S. Branicky, Dec 28 2021

Formula

{k: A224787(k) in A000040}. - R. J. Mathar, Mar 25 2025

Extensions

Example clarified by Harvey P. Dale, Feb 01 2013
Minor edits by Hieronymus Fischer, May 06 2013

A134620 Numbers such that the sum of 4th power of their prime factors is a prime.

Original entry on oeis.org

6, 10, 12, 14, 22, 34, 38, 40, 45, 46, 74, 82, 117, 118, 122, 126, 142, 152, 158, 171, 194, 231, 262, 278, 296, 345, 358, 363, 376, 384, 387, 429, 432, 446, 454, 458, 482, 486, 490, 500, 507, 522, 536, 550, 566, 584, 626, 627, 634, 639, 663, 675, 686, 704, 705
Offset: 1

Views

Author

Hieronymus Fischer, Nov 11 2007

Keywords

Comments

Prime factors must be taken with multiplicity. - Harvey P. Dale, May 23 2012
The calculation of higher terms is time-consuming, since for any number of the form 2*p with a prime number p > 10^5 the primality test have to be accomplished for a number > 10^20. - Hieronymus Fischer, May 21 2013

Examples

			a(2) = 10, since 10 = 2*5 and 2^4+5^4 = 641 which is prime.
a(9) = 45, since 45 = 3*3*5 and 3^4+3^4+5^4 = 787 which is prime.
a(9883) = 333314, since 333314 = 3*166657 and 2^4+166657^4 = 771425941499397811217 which is prime.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[1000],PrimeQ[Total[Flatten[Table[First[#],{Last[#]}]&/@ FactorInteger[#]]^4]]&] (* Harvey P. Dale, May 23 2012 *)

A134613 Numbers such that the root mean cube of their prime factors is a nonprime integer (where the root mean cube of c and d is ((c^3+d^3)/2)^(1/3)).

Original entry on oeis.org

1, 1512, 337365, 375360, 523809, 1177176, 1255254, 1380918, 1549431, 2277345, 2286144, 2816883, 3320713, 3340428, 3838185, 4378333, 6726969, 7043655, 8311212, 10281284, 10323390, 10666227, 10708544, 12333468, 14185724, 15883803, 21432000, 25760763, 27111825
Offset: 1

Views

Author

Hieronymus Fischer, Nov 11 2007

Keywords

Comments

The prime factors are taken with multiplicity.
Numbers included in A134611, but not in A134612.
For n > 1, also numbers included in A134614, but not in A134615; a(2) = 1512 is the minimal number with this property.
No prime number and no power (> 1) of a prime number can be a term.

Examples

			a(1) = 1, since 1 has no prime factors, and so the cube mean is zero (by definition of empty sums).
a(2) = 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.
		

Crossrefs

Programs

  • PARI
    isok(n) = if (n==1, return(1)); sc = 0; nb = 0; f = factor(n); for (i=1, #f~, sc += f[i, 2]*f[i, 1]^3; nb += f[i, 2]; ); return (type(quot = sc/nb) == "t_INT" && ispower(quot, 3, &cr) && (! isprime(cr))); \\ Michel Marcus, Jul 15 2013; corrected Jun 13 2022

Extensions

Extended, edited and added initial term a(1) = 1 by Hieronymus Fischer, May 30 2013

A134615 Numbers (excluding primes and powers of primes) such that the root mean cube of their prime factors is a prime (where the root mean cube of c and d is ((c^3+d^3)/2)^(1/3)).

Original entry on oeis.org

707265, 1922816, 2284389, 12023505, 14689836, 21150800, 29444140, 30682000, 36533504, 39372480, 46309837, 52163097, 67303740, 73558065, 85751055, 107366283, 115291904, 161976045, 190384425, 204399585, 218317275, 231443940, 274960400, 286618640
Offset: 1

Views

Author

Hieronymus Fischer, Nov 11 2007

Keywords

Comments

The prime factors are taken with multiplicity.
Numbers included in A134612, but not in A025475.
a(1) = 707265 is the minimal number with this property. a(3) = 2284389 is the greatest such number < 10^7.

Examples

			a(1) = 707265, since 707265 = 3*3*3*5*13*13*31 and ((3*3^3+5^3+2*13^3+31^3)/7)^(1/3) = 4913^(1/3) = 17.
		

Crossrefs

Programs

  • PARI
    isok(n) = {if (omega(n) == 1, return (0)); f = factor(n); s = sum(i=1, #f~, f[i,2]*f[i,1]^3); s = s/bigomega(n); if (type(s) != "t_INT", return (0)); if (! ispower(s, 3, &p), return (0)); isprime(p);} \\ Michel Marcus, Nov 03 2013

Extensions

More terms and minor edits by Hieronymus Fischer, May 06 2013, May 30 2013
Showing 1-6 of 6 results.