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!)
 A236771 a(n) = n + floor(n/2 + n^2/3). 3
 0, 1, 4, 7, 11, 15, 21, 26, 33, 40, 48, 56, 66, 75, 86, 97, 109, 121, 135, 148, 163, 178, 194, 210, 228, 245, 264, 283, 303, 323, 345, 366, 389, 412, 436, 460, 486, 511, 538, 565, 593, 621, 651, 680, 711, 742, 774, 806, 840, 873, 908, 943, 979 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS If a(k) is prime then k == 3, 4 or 8 (mod 12). The primes are 7, 11, 97, 109, 163, 283, 389, 593, 1129, 1987, 2039, 2713, ... . This sequence is between A042965 and A236773. LINKS Bruno Berselli, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1,1,0,-1,-1,1). FORMULA G.f.: x*(1 + 3*x + 2*x^2 - 2*x^4) / ((1 + x)*(1 + x + x^2)*(1 - x)^3). a(n) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6). a(n) = (2*n*(2*n+9) - 2*(-1)^floor(2*(n-1)/3) + 3*(-1)^n - 5)/12. a(n+2) - a(n) = A004772(n+4). Also: a(n) = n + floor(n/2) + floor(n^2/3). MATHEMATICA Table[n + Floor[n/2 + n^2/3], {n, 0, 60}] PROG (MAGMA) [n+Floor(n/2+n^2/3): n in [0..60]]; CROSSREFS Cf. A004772; A032766: n+floor(n/2). Cf. A042965: n+floor(1/2+n/3); A236773: n+floor(n^2/2+n^3/3). Cf. A281333: 1+floor(n/2)+floor(n^2/3). Sequence in context: A134918 A310741 A078916 * A310742 A310743 A310744 Adjacent sequences:  A236768 A236769 A236770 * A236772 A236773 A236774 KEYWORD nonn,easy AUTHOR Bruno Berselli, Feb 06 2014 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 March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)