login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092200 Expansion of (1+2x)/((1-x)(1-x^3)). 2
1, 3, 3, 4, 6, 6, 7, 9, 9, 10, 12, 12, 13, 15, 15, 16, 18, 18, 19, 21, 21, 22, 24, 24, 25, 27, 27, 28, 30, 30, 31, 33, 33, 34, 36, 36, 37, 39, 39, 40, 42, 42, 43, 45, 45, 46, 48, 48, 49, 51, 51, 52, 54, 54, 55, 57, 57, 58, 60, 60, 61, 63, 63, 64, 66, 66, 67, 69, 69, 70, 72, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Partial sums of A010872(n+1).

Essentially the same as A130481. - R. J. Mathar, Jun 13 2008

LINKS

Table of n, a(n) for n=0..71.

Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1).

FORMULA

G.f.: (1+2x)/(1-x-x^3+x^4); a(n)=4/3+n+2cos(Pi*2(n-1)/3)/3; a(n)=sum{k=0..n, mod(k+1, 3) }; a(n)=(n+1)(n+2)/2-3sum{k=0..n, floor((k+1)/3)}; a(n)=1+n+sum{k=0..n, jacobi(k, 3) }.

a(0)=1, a(1)=3, a(2)=3, a(3)=4, a(n)=a(n-1)+a(n-3)-a(n-4). - Harvey P. Dale, Sep 15 2011

a(n)=n+1 when n+2 is not a multiple of 3, and a(n)=n+2 when n+2 is a multiple of 3. - Dennis P. Walsh, Aug 06 2012

MAPLE

a:=n->add(chrem( [n, j], [1, 3] ), j=1..n):seq(a(n), n=1..72); # Zerinvary Lajos, Apr 08 2009

MATHEMATICA

f[n_]:=Mod[n, 3]; s=0; lst={}; Do[AppendTo[lst, s+=f[n]], {n, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 07 2010 *)

CoefficientList[Series[(1+2x)/((1-x)(1-x^3)), {x, 0, 80}], x] (* or *) LinearRecurrence[{1, 0, 1, -1}, {1, 3, 3, 4}, 81] (* Harvey P. Dale, Sep 15 2011 *)

CROSSREFS

Sequence in context: A265652 A074883 A196245 * A130481 A145805 A277192

Adjacent sequences:  A092197 A092198 A092199 * A092201 A092202 A092203

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Feb 24 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 2 08:16 EDT 2020. Contains 334767 sequences. (Running on oeis4.)