login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036406 Ceiling(n^2/8). 2
0, 1, 1, 2, 2, 4, 5, 7, 8, 11, 13, 16, 18, 22, 25, 29, 32, 37, 41, 46, 50, 56, 61, 67, 72, 79, 85, 92, 98, 106, 113, 121, 128, 137, 145, 154, 162, 172, 181, 191, 200, 211, 221, 232, 242, 254, 265, 277, 288, 301, 313, 326, 338, 352, 365, 379, 392 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

Index to sequences with linear recurrences with constant coefficients, signature (2,-1,0,1,-2,1)

FORMULA

a(n) = (1/16)*(2n^2 + 9 - 5(-1)^n - 2(-1)^floor(n/2) + 2(-1)^floor((n-1)/2)). - Ralf Stephan, Jun 10 2005

G.f.: -x*(1-x-x^3+x^2+x^4) / ( (1+x)*(1+x^2)*(x-1)^3 ). - R. J. Mathar, Jan 22 2011

a(0)=0, a(1)=1, a(2)=1, a(3)=2, a(4)=2, a(5)=4, a(n)=2*a(n-1)-a(n-2)+ a(n-4)- 2*a(n-5)+a (n-6). [From Harvey P. Dale, June 21 2011]

MATHEMATICA

Ceiling[Range[0, 60]^2/8] (* or *) LinearRecurrence[{2, -1, 0, 1, -2, 1}, {0, 1, 1, 2, 2, 4}, 60] (* From Harvey P. Dale, June 21 2011 *)

PROG

(MAGMA) [Ceiling(n^2/8):n in [0..60]]; // Vincenzo Librandi, Oct 21 2011

CROSSREFS

Sequence in context: A053036 A067957 A120326 * A029007 A058678 A030739

Adjacent sequences:  A036403 A036404 A036405 * A036407 A036408 A036409

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.