login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007419 Largest number not the sum of distinct n-th-order polygonal numbers.
(Formerly M5237)
4
33, 128, 159, 267, 387, 713, 1152, 929, 994, 1240, 1770, 1943, 1950, 2288, 2442, 2898, 3077, 3145, 3719, 4152, 4357, 4392, 4841, 6381, 6645, 6909, 7173, 8441, 7813, 8081, 8349, 9641, 10833, 10752, 11067, 11382, 12363, 14524, 13616, 15405, 15789, 17184 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 186.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=3..44.

Index to sequences related to polygonal numbers

CROSSREFS

Cf. A025524 (number of numbers not the sum of distinct n-th-order polygonal numbers)

Cf. A053614, A001422, A121405 (sequences for triangular, square, and pentagonal numbers)

Sequence in context: A235902 A235895 A010020 * A158575 A209981 A036546

Adjacent sequences:  A007416 A007417 A007418 * A007420 A007421 A007422

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 00:58 EDT 2020. Contains 333104 sequences. (Running on oeis4.)