Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140149
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140149 a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^3 if n is even. +0
2
1, 9, 18, 82, 107, 323, 372, 884, 965, 1965, 2086, 3814, 3983, 6727, 6952, 11048, 11337, 17169, 17530, 25530, 25971, 36619, 37148, 50972, 51597, 69173, 69902, 91854, 92695, 119695, 120656, 153424, 154513, 193817, 195042, 241698, 243067 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=a(n-1)+{[1-(-1)^n]/2}*n^2+{[1+(-1)^n]/2}*n^3, with a(1)=1 a(n)= (1/16)-(1/4)*(-1)^n*n-(1/16)*(-1)^n+(1/4)*(-1)^n*n^3+(5/12)*n^3+(1/8)*(-1)^n*n^2+(3/8)*n^2+(1 /12)*n+(1/8)*n^4, with n>=1 - Paolo P. Lava (ppl(AT)spl.at), Jun 06 2008

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

MATHEMATICA

a = {}; r = 2; s = 3; 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: A022669 A107313 A166640 this_sequence A066711 A033651 A050250

Adjacent sequences: A140146 A140147 A140148 this_sequence A140150 A140151 A140152

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research