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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140144 a(1)=1, a(n)=a(n-1)+n^1 if n odd, a(n)=a(n-1)+ n^0 if n is even. 2
1, 2, 5, 6, 11, 12, 19, 20, 29, 30, 41, 42, 55, 56, 71, 72, 89, 90, 109, 110, 131, 132, 155, 156, 181, 182, 209, 210, 239, 240, 271, 272, 305, 306, 341, 342, 379, 380, 419, 420, 461, 462, 505, 506, 551, 552, 599, 600, 649, 650, 701, 702, 755, 756, 811, 812, 869 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Equals triangle A177990 * [1,2,3,...] [From Gary W. Adamson (qntmpkt(AT)yahoo.com), May 16 2010]

FORMULA

a(n)=a(n-1)+{[1-(-1)^n]/2}*n+{[1+(-1)^n]/2}, with a(1)=1 a(n)=-(1/8)-(1/4)*(-1)^n*n+(1/8)*(-1)^n+(1/4)*n^2+(3/4)*n, with n>=1 - Paolo P. Lava (paoloplava(AT)gmail.com), Jun 06 2008

a(n)=a(n-1)+2a(n-2)-2a(n-3)-a(n-4)+a(n-5). G.f.: x*(-1-x-x^2+x^3)/((1+x)^2*(x-1)^3). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 22 2009]

MATHEMATICA

a = {}; r = 1; s = 0; Do[k = 0; Do[k = k + (Sin[Pi m/2]^2) m^r + (Cos[Pi m/2]^2) m^s, {m, 1, n}]; AppendTo[a, k], {n, 1, 100}]; a (*Artur Jasinski*)

CROSSREFS

Cf. A000027, A000217, A000330, A000537, A000538, A000539, A136047, A140113.

Cf. A177990 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), May 16 2010]

Sequence in context: A160645 A026344 A057812 * A030130 A164874 A045845

Adjacent sequences:  A140141 A140142 A140143 * A140145 A140146 A140147

KEYWORD

nonn

AUTHOR

Jasinski Artur (grafix(AT)csl.pl), May 12 2008

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 00:47 EST 2012. Contains 205567 sequences.