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!)
A047876 a(n) = Sum{T(i,n-i): i=0,1,...,n}, array T as in A049604. 0

%I #10 Jun 11 2016 23:20:27

%S 0,6,8,8,12,18,22,28,36,42,52,64,68,82,98,104,118,138,146,164,184,194,

%T 216,240,248,274,302,312,338,370,382,412,444,458,492,528,540,578,618,

%U 632,670,714,730,772,816,834,880,928,944,994,1046

%N a(n) = Sum{T(i,n-i): i=0,1,...,n}, array T as in A049604.

%F From _Chai Wah Wu_, Jun 11 2016: (Start)

%F a(n) = 2*a(n-3) + a(n-4) - a(n-6) - 2*a(n-7) + a(n-10) for n > 14 (conjectured).

%F G.f.: 2*x*(x^13 + x^11 - x^9 - 2*x^8 - 4*x^7 - x^6 + x^5 + 2*x^4 - 4*x^2 - 4*x - 3)/(x^10 - 2*x^7 - x^6 + x^4 + 2*x^3 - 1) (conjectured). (End)

%K nonn

%O 0,2

%A _Clark Kimberling_

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 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)