login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275746 The number of integers not representable as a sum of n-th powers of odd primes. 3
3, 62, 840, 12350, 99912, 2358913, 12173587, 120900206, 1224812108, 20439317893, 130357794430, 1534358290778, 13544972574336, 142155007727976, 1648210755327790, 14816750258004918, 151900144117560355, 1525977077403654254, 16185530587326104490 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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
LINKS
S. Boecker and Z. Liptak, A Fast and Simple Algorithm for the Money Changing Problem, Algorithmica, 48 (2007), 413-432.
EXAMPLE
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.
Sequence in context: A264463 A239576 A279974 * A177496 A104403 A301609
KEYWORD
nonn
AUTHOR
Mike Oakes, Aug 07 2016
EXTENSIONS
More terms from Mike Oakes, Aug 17 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 13 11:33 EDT 2024. Contains 371640 sequences. (Running on oeis4.)