login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341905 a(n) = a(n-1) + a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2. 1
3, 0, 2, 8, 10, 22, 48, 90, 182, 368, 730, 1462, 2928, 5850, 11702, 23408, 46810, 93622, 187248, 374490, 748982, 1497968, 2995930, 5991862, 11983728, 23967450, 47934902, 95869808, 191739610, 383479222, 766958448, 1533916890, 3067833782, 6135667568, 12271335130 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Evren Eyican Polatlı and Yüksel Soykan, On generalized third-order Jacobsthal numbers, Asian Res. J. of Math. (2021) Vol. 17, No. 2, 1-19, Article No. ARJOM.66022.
FORMULA
G.f.: (-3 + 3*x + x^2)/(-1 + x + x^2 + 2*x^3).
a(n) = (10*2^(n-1) + 13*A049347(n) - 9*A079978(n+1) + 3)/7. - Greg Dresden, Jun 20 2021
MAPLE
a:= n-> (<<0|1|0>, <0|0|1>, <2|1|1>>^n. <<3, 0, 2>>)[1, 1]:
seq(a(n), n=0..34); # Alois P. Heinz, Jun 04 2021
MATHEMATICA
LinearRecurrence[{1, 1, 2}, {3, 0, 2}, 35] (* or *)
CoefficientList[Series[(-3 + 3 x + x^2)/(-1 + x + x^2 + 2 x^3), {x, 0, 34}], x]
CROSSREFS
Sequence in context: A240660 A347418 A330646 * A354905 A099095 A061980
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Jun 04 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)