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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083277 k appears 3k-2 times. 0
 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = ceiling((1+sqrt(24*n+1))/6) = floor((7+sqrt(24*n-23))/6). PROG (PARI) a(n) = (7+sqrt(24*n-23))\6; \\ Michel Marcus, Oct 30 2019 CROSSREFS Cf. A016777 (3n-2 with offset 1). Sequence in context: A330780 A090973 A076634 * A274011 A307726 A235123 Adjacent sequences:  A083274 A083275 A083276 * A083278 A083279 A083280 KEYWORD nonn AUTHOR Daniele Parisse (daniele.parisse(AT)m.eads.net), Jun 02 2003, Jul 07 2007 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 August 11 06:25 EDT 2020. Contains 336422 sequences. (Running on oeis4.)