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!)
A164965 Cumulative sums of A010892. 5
1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

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

FORMULA

a(n) = (1/30)*(2*((n+1) mod 6) + 7*((n+2) mod 6) + 7*((n+3) mod 6) + 2*((n+4) mod 6) - 3*((n+5) mod 6) - 3*(n mod 6)), with n>=1. - Paolo P. Lava, Dec 03 2009

G.f.: 1/((1 - x)*(1 - x + x^2)). - Philippe Deléham, Oct 11 2011

a(n) = a(n-1) - a(n-2) + 1. - Arkadiusz Wesolowski, Jun 08 2013

a(n) = -floor((n - 4)/6) - floor((n - 3)/6) + floor((n - 1)/6) + floor(n/6). - John M. Campbell, Dec 23 2016

MATHEMATICA

Table[-Floor[1/6 (-4 + n)] - Floor[1/6 (-3 + n)] + Floor[1/6 (-1 + n)] + Floor[n/6], {n, 0, 100}] (* John M. Campbell, Dec 23 2016 *)

LinearRecurrence[{2, -2, 1}, {1, 2, 2}, 100] (* Harvey P. Dale, Jul 17 2020 *)

CROSSREFS

Cf. A010892, A021823, A164925, A108299.

Sequence in context: A024712 A281497 A198243 * A021823 A131026 A333839

Adjacent sequences:  A164962 A164963 A164964 * A164966 A164967 A164968

KEYWORD

easy,nonn

AUTHOR

Mark Dols, Sep 02 2009

EXTENSIONS

Offset corrected by John M. Campbell, Dec 23 2016

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 October 24 14:44 EDT 2021. Contains 348233 sequences. (Running on oeis4.)