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!)
A176873 Smallest possible integer m>=3 such that n is the sum of an m-gonal number and a k-gonal number for some k<=m. 2
3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 3, 5, 3, 3, 4, 3, 3, 3, 3, 3, 4, 5, 3, 4, 3, 3, 3, 3, 4, 4, 3, 3, 4, 3, 3, 5, 3, 3, 4, 3, 4, 4, 4, 3, 3, 3, 3, 4, 3, 3, 7, 5, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 5, 3, 3, 4, 3, 3, 3, 3, 3, 4, 4, 3, 4, 3, 3, 3, 3, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
FORMULA
a(n) = min max(A176774(i),A176774(n-i)), where min is taken over i=0,1,...,n under the assumption that A176774(2) = +infinity.
PROG
(PARI) a(n)=if(ispolygonal(n, 3) || ispolygonal(n-1, 3), return(3)); for(m=3, if(n>5, (n+1)\2, 4), my(i=2, t); while((t=n-(m-2)*binomial(i, 2)-i)>=0, for(k=3, m, if(ispolygonal(t, k), return(m))); i++)) \\ Charles R Greathouse IV, Dec 11 2015
CROSSREFS
Sequence in context: A334625 A209291 A332875 * A227727 A050499 A304431
KEYWORD
nonn
AUTHOR
Max Alekseyev, Apr 27 2010
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 March 28 16:58 EDT 2024. Contains 371254 sequences. (Running on oeis4.)