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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227177 n occurs n^2 - n + 1 times. 6
 0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is the least integer k such that A006527(k) >= n, which implies that each n occurs A002061(n) times. LINKS Antti Karttunen, Table of n, a(n) for n = 0..9951 FORMULA a(k + (j^3-j^2+5*j)/3) = j for all j>=0, k=0..(j^2-j). - Jinyuan Wang, Nov 24 2018 MATHEMATICA Flatten[Map[ConstantArray[#, (#-2) (#-1)+1]-1&, Range[7]]] (* Peter J. C. Moses, Jul 14 2013 *) Flatten[Table[#, {#^2-#+1}]&/@Range[0, 7]] (* Harvey P. Dale, Sep 25 2013 *) PROG (Scheme, with Antti Karttunen's IntSeq-library): (define A227177 (LEAST-GTE-I 0 0 A006527)) (PARI) vec(N)=concat(vector(N, i, vector(i^2-i+1, j, i))) \\ Jinyuan Wang, Dec 01 2018 CROSSREFS Cf. A000196, A002061, A006527, A227179, A227181, A227147. Sequence in context: A082527 A294235 A186188 * A132944 A210568 A262887 Adjacent sequences:  A227174 A227175 A227176 * A227178 A227179 A227180 KEYWORD nonn AUTHOR Antti Karttunen, Jul 03 2013 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.

Last modified November 25 08:30 EST 2020. Contains 338623 sequences. (Running on oeis4.)