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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137719 Sequence based on the pattern [3n, 3n, 3n, 3n+2, 3n+1, 3n+2]. 4
0, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 8, 7, 8, 9, 9, 9, 11, 10, 11, 12, 12, 12, 14, 13, 14, 15, 15, 15, 17, 16, 17, 18, 18, 18, 20, 19, 20, 21, 21, 21, 23, 22, 23, 24, 24, 24, 26, 25, 26, 27, 27, 27, 29, 28, 29, 30, 30, 30, 32, 31, 32, 33, 33, 33, 35, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Powers of 2 in a scaled version of the Hankel transform of A106191.

LINKS

M. F. Hasler, Table of n, a(n) for n = 0..1000

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

FORMULA

a(n) = log(abs(A137718(n)))/log(2).

From R. J. Mathar, Feb 10 2008: (Start)

O.g.f.: 1/(2*(x-1)^2) + (x-1)/(3*(x^2+x+1)) - 1/(4*(x+1)) - 1/(12*(x-1)).

a(n) = 3 + a(n-6). (End)

a(n) = Sum_{k=0..n} (1/30)*((k mod 6) + 6*((k+1) mod 6) + ((k+2) mod 6) - 9*((k+3) mod 6) + 16*((k+4) mod 6) - 9*((k+5) mod 6)). - Paolo P. Lava, Mar 20 2008

From Colin Barker, Jun 27 2013: (Start)

a(n) = a(n-2) + a(n-3) - a(n-5).

G.f.: x*(x+2) / ((x-1)^2*(x+1)*(x^2+x+1)). (End)

a(n) = Sum_{i=0..floor(n/2)} (2n-i mod 3). - Wesley Ivan Hurt, Mar 22 2016

a(n) = A004526(n+1) + A079978(n). - R. J. Mathar, Oct 27 2019

MAPLE

A137719:=n->add(2*n-i mod 3, i=0..floor(n/2)): seq(A137719(n), n=0..100); # Wesley Ivan Hurt, Mar 21 2016

MATHEMATICA

Table[Sum[Mod[2 n - i, 3], {i, 0, Floor[n/2]}], {n, 0, 80}] (* Wesley Ivan Hurt, Mar 21 2016 *)

PROG

(MAGMA) [&+[(2*n-i) mod 3: i in [0..Floor(n/2)]]: n in [0..80]]; // Wesley Ivan Hurt, Mar 21 2016

(PARI) apply( A137719(n)={(n=divrem(n-1, 6))[1]*3+min(n[2]+2*!n[2], 3)}, [0..30]) \\ M. F. Hasler, Oct 27 2019

CROSSREFS

Cf. A106191, A137718.

Sequence in context: A208882 A186519 A241091 * A029165 A035431 A008681

Adjacent sequences:  A137716 A137717 A137718 * A137720 A137721 A137722

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Feb 08 2008

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 December 3 13:43 EST 2021. Contains 349463 sequences. (Running on oeis4.)