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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A176775 Index of n as m-gonal number for the smallest possible m (=A176774(n)). 9
 2, 2, 2, 3, 2, 2, 3, 4, 2, 3, 2, 2, 5, 4, 2, 3, 2, 2, 6, 4, 2, 3, 5, 2, 3, 7, 2, 3, 2, 2, 3, 4, 5, 8, 2, 2, 3, 4, 2, 3, 2, 2, 9, 4, 2, 3, 7, 2, 6, 4, 2, 3, 10, 2, 3, 4, 2, 3, 2, 2, 3, 8, 5, 11, 2, 2, 3, 7, 2, 3, 2, 2, 5, 4, 2, 12, 2, 2, 9, 4, 2, 3, 5, 2, 3, 4, 2, 3, 13, 8, 3, 4, 5, 6, 2, 2, 3, 10, 2, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS a(n)=2 iff A176774(n)=n. LINKS Michel Marcus, Table of n, a(n) for n = 3..10000 Eric Weisstein's World of Mathematics, Polygonal Number. FORMULA a(n) = (m-4+sqrt((m-4)^2+8*(m-2)*n)) / (2*m-4), where m = A176774(n). PROG (PARI) f(n) = {k=3; while (! ispolygonal(n, k), k++); k; } \\ A176774 a(n) = my(m=f(n)); (m-4+sqrtint((m-4)^2+8*(m-2)*n)) / (2*m-4); \\ Michel Marcus, May 09 2021 CROSSREFS Cf. A176774. Sequence in context: A226056 A104011 A242879 * A175778 A357039 A226182 Adjacent sequences: A176772 A176773 A176774 * A176776 A176777 A176778 KEYWORD nonn AUTHOR Max Alekseyev, Apr 25 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.

Last modified December 5 15:27 EST 2022. Contains 358588 sequences. (Running on oeis4.)