A174958 - OEIS

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

A174958

a(n)=Sum((A008292(n - j, j) - C(n - j - 1, j))/2, j=0, [(n - 1)/2])

0, 0, 0, 0, 1, 4, 15, 56, 214, 854, 3607, 16172, 76853, 386082, 2044198, 11373124, 66300473, 403939612, 2566116299, 16962629860, 116452790838, 828903740138, 6107712000563, 46521422681724, 365811331693305, 2965957618809246, 24767913121016790, 212803409969904264

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,6

COMMENTS

Sequence A000800 minus the Lucas Fibonacci sum divided by two.

REFERENCES

Burton, David M.,Elementary number theory,McGraw Hill,N.Y.,2002,p 286, problem 23

LINKS

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

MATHEMATICA

a = Table[Sum[(Eulerian[n -

j, j] - Binomial[n - j - 1, j])/2, {j, 0,