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.

A275743 The number of integers not representable as a sum of n-th powers of primes.

Original entry on oeis.org

1, 12, 83, 600, 3058, 18222, 130411, 783480, 3418488, 24857930, 181308931, 610675758, 6529545751, 18840405540, 102444103996, 956394012747, 3188347929974, 27288773879397, 96923972375603, 702926766993950, 2980668206142664, 20046633698159181, 88137290213079355, 502113072640777785
Offset: 1

Views

Author

Mike Oakes, Aug 07 2016

Keywords

Comments

I executed the algorithm in Boecker et al. (2007) with a PARI/GP program, which needed 34 GB RAM and 2 hours to run for n=30. Results checked by an independent algorithm. - Mike Oakes, Aug 17 2016

Examples

			For n=2, there are 12 nonnegative integers that cannot be written as a sum of squares of primes.
		

Crossrefs

Extensions

More terms from Mike Oakes, Aug 17 2016
a(16) corrected by Andrew Howroyd, Feb 23 2018

A275746 The number of integers not representable as a sum of n-th powers of odd primes.

Original entry on oeis.org

3, 62, 840, 12350, 99912, 2358913, 12173587, 120900206, 1224812108, 20439317893, 130357794430, 1534358290778, 13544972574336, 142155007727976, 1648210755327790, 14816750258004918, 151900144117560355, 1525977077403654254, 16185530587326104490
Offset: 1

Views

Author

Mike Oakes, Aug 07 2016

Keywords

Comments

I executed the algorithm in Boecker et al. (2007) with a PARI/GP program, which needed 36 GB RAM and 2 hours to run for n=19. Results checked by an independent algorithm. - Mike Oakes, Aug 17 2016

Examples

			For n=2, there are 62 integers that cannot be written as a sum of squares of odd primes.
		

Crossrefs

Cf. A275747. For all primes, including 2, see A275743, A122615.

Extensions

More terms from Mike Oakes, Aug 17 2016

A275747 Largest integer which cannot be written as a sum of n-th powers of odd primes.

Original entry on oeis.org

4, 114, 1595, 24195, 190463, 4613167, 23815950, 240951477, 2448240688, 40379465440, 258630935725, 3044619003271, 26232953378021, 264066033166293, 3218396161633945, 29248021240625765, 302064442857973298, 3027736057187540859, 32207709908667683204
Offset: 1

Views

Author

Mike Oakes, Aug 07 2016

Keywords

Comments

Except for n=6, only the powers of 3 primes are needed, namely 3^n, 5^n and 7^n, which leads to an ultra-fast O(n) execution time. I executed the algorithm in Greenberg (1988) with a PARI/GP program in only a few seconds for 1000 terms. - Mike Oakes, Aug 16 2016

Examples

			For n=2, 114 is the largest integer which cannot be written as a sum of squares of odd primes.
		

Crossrefs

Cf. A275746. For all primes, including 2, see A275743, A122615.

Programs

  • Mathematica
    With[{prs=Prime[Range[2,5]]},Table[FrobeniusNumber[prs^n],{n,20}]] (* Harvey P. Dale, Sep 19 2018 *)
Showing 1-3 of 3 results.