reviewed

approved

proposed

reviewed

editing

proposed

Floretion Algebra Multiplication Program, FAMP code: (a(n)) = 2dia[I]forseq[ + .5'i + .5'ii' + .5'ij' + .5'ik' ], 2dia[J]forseq = 2dia[K]forseq = A001654, mixforseq = A001519, tesforseq = A099016, vesforseq = A000004. Identity used: dia[I] + dia[J] + dia[K] + mix + tes = ves

Floretion Algebra Multiplication Program, FAMP code: (a(n)) = 2dia[I]forseq[ + .5'i + .5'ii' + .5'ij' + .5'ik' ], 2dia[J]forseq = 2dia[K]forseq = A001654, mixforseq = A001519, tesforseq = A099016, vesforseq = A000004. Identity used: dia[I] + dia[J] + dia[K] + mix + tes = ves

approved

editing

editing

approved

a(n) = (-1)^n +9*A001906(n+1) -A001906(n) . - R. J. Mathar, Sep 11 2019

approved

editing

reviewed

approved

proposed

reviewed

editing

proposed

G.f.: (Expansion of (x+2)/(() / ((x+1)()*(x^2-3x3*x+1)).

2, 5, 14, 36, 95, 248, 650, 1701, 4454, 11660, 30527, 79920, 209234, 547781, 1434110, 3754548, 9829535, 25734056, 67372634, 176383845, 461778902, 1208952860, 3165079679, 8286286176, 21693778850, 56795050373, 148691372270, 389279066436, 1019145827039

Colin Barker, <a href="/A102714/b102714.txt">Table of n, a(n) for n = 0..1000</a>

a(n) = 2*a(n-1) + 2*a(n-2) - a(n-3), a(0) = 2, a(1) = 5, a(2) = 14; a(n) + a(n+1) = A100545(n); a(n) + 2*a(n+1) + a(n+2) = A055849(n+2); a(n) + 2*A001654(n) - A099016(n+2) + 2*A001519(n) = 0.

a(n) + a(n+1) = A100545(n).

a(n) + 2*a(n+1) + a(n+2) = A055849(n+2).

a(n) + 2*A001654(n) - A099016(n+2) + 2*A001519(n) = 0.

a(n) = (2^(-1-n)*((-1)^n*2^(1+n)+(9-5*sqrt(5))*(3-sqrt(5))^n+(3+sqrt(5))^n*(9+5*sqrt(5))))/5. - Colin Barker, Oct 01 2016

(PARI) a(n) = round((2^(-1-n)*((-1)^n*2^(1+n)+(9-5*sqrt(5))*(3-sqrt(5))^n+(3+sqrt(5))^n*(9+5*sqrt(5))))/5) \\ Colin Barker, Oct 01 2016

(PARI) Vec((x+2)/((x+1)*(x^2-3*x+1)) + O(x^40)) \\ Colin Barker, Oct 01 2016

approved

editing