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!)
A001476 Numbers that are not the sum of distinct positive cubes. 10
2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33, 34, 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, 66, 67, 68, 69, 70, 71, 74, 75, 76 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Complement of A003997.

There are 85 terms below 100, 793 terms below 1000, but only 2765 terms below 10^4, and only 23 more up to the largest term a(2788)=12758. - M. F. Hasler, Feb 25 2012

Indices k such that A279329(k) = 0. - Vaclav Kotesovec, Sep 22 2017

LINKS

T. D. Noe, Table of n, a(n) for n = 1..2788 (complete sequence)

R. E. Dressler and T. Parker, 12,758, Math. Comp. 28 (1974), 313-314.

R. Sprague, Über Zerlegungen in n-te Potenzen mit lauter verschiedenen Grundzahlen, Math. Z. 51, (1948). 466-468.

Eric Weisstein's World of Mathematics, Cubic Number

MATHEMATICA

Cubes[ n_ ] := Block[ {A, i}, A = {0}; if[ n>0, Do[ A = Union[ A, A + i*i*i ], {i, n} ]; ]; Return[ A ]; ]; Q = Complement[ Table[ i, {i, 1, 12760} ], Cubes[ 23 ] ]

PROG

(PARI) select( is_A001476(n, m=n)={m^3>n&&m=sqrtnint(n, 3); n!=m^3&&!while(m>1, is_A001476(n-m^3, m--)||return)}, [1..77]) \\ M. F. Hasler, Apr 21 2020

CROSSREFS

Cf. A001422, A003997, A279329, A279486.

Sequence in context: A102455 A073678 A210947 * A031981 A279486 A336063

Adjacent sequences:  A001473 A001474 A001475 * A001477 A001478 A001479

KEYWORD

nonn,fini,full

AUTHOR

Jeff Adams (jeff.adams(AT)byu.net)

EXTENSIONS

Definition clarified by Jeppe Stig Nielsen, Jan 27 2015

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 September 26 21:59 EDT 2022. Contains 357050 sequences. (Running on oeis4.)