Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135301
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135301 a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even. +0
2
1, 5, 6, 22, 23, 59, 60, 124, 125, 225, 226, 370, 371, 567, 568, 824, 825, 1149, 1150, 1550, 1551, 2035, 2036, 2612, 2613, 3289, 3290, 4074, 4075, 4975, 4976, 6000, 6001, 7157, 7158, 8454, 8455, 9899, 9900, 11500, 11501, 13265, 13266, 15202, 15203 (list; graph; listen)
OFFSET

1,2

FORMULA

O.g.f.: x*(x^4+4*x^3-2*x^2+4*x+1)/((-1+x)^4*(1+x)^3) . a(2n-1)=4*n^3/3-2*n^2+5*n/3. a(2n)=4*n^3/3+2*n^2+5*n/3. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 17 2008

MATHEMATICA

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

Adjacent sequences: A135298 A135299 A135300 this_sequence A135302 A135303 A135304

Sequence in context: A132796 A006492 A110344 this_sequence A030672 A030682 A042605

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 October 6 15:53 EDT 2008. Contains 144667 sequences.


AT&T Labs Research