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!)
A007419 Largest number not the sum of distinct n-th-order polygonal numbers.
(Formerly M5237)
6

%I M5237 #15 Jul 28 2016 09:00:11

%S 33,128,159,267,387,713,1152,929,994,1240,1770,1943,1950,2288,2442,

%T 2898,3077,3145,3719,4152,4357,4392,4841,6381,6645,6909,7173,8441,

%U 7813,8081,8349,9641,10833,10752,11067,11382,12363,14524,13616,15405,15789,17184

%N Largest number not the sum of distinct n-th-order polygonal numbers.

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

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

%H <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>

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

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

%K nonn

%O 3,1

%A _N. J. A. Sloane_.

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 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)