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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140146 a(1)=1, a(n)=a(n-1)+n^1 if n odd, a(n)=a(n-1)+ n^4 if n is even. 1
1, 17, 20, 276, 281, 1577, 1584, 5680, 5689, 15689, 15700, 36436, 36449, 74865, 74880, 140416, 140433, 245409, 245428, 405428, 405449, 639705, 639728, 971504, 971529, 1428505, 1428532, 2043188, 2043217, 2853217, 2853248, 3901824, 3901857 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

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

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

MATHEMATICA

a = {}; r = 1; s = 4; 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.

Sequence in context: A146169 A045020 A069961 * A039502 A039505 A166875

Adjacent sequences:  A140143 A140144 A140145 * A140147 A140148 A140149

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 17 05:54 EST 2012. Contains 205985 sequences.