The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A174958 a(n)=Sum((A008292(n - j, j) - C(n - j - 1, j))/2, j=0, [(n - 1)/2]) 0
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
MATHEMATICA
a = Table[Sum[(Eulerian[n -
j, j] - Binomial[n - j - 1, j])/2, {j, 0,
Floor[(n - 1)/2]}], {n, 0, 30}]
CROSSREFS
Sequence in context: A047128 A087438 A131497 * A244824 A316592 A077823
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Dec 02 2010
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 June 10 07:44 EDT 2024. Contains 373253 sequences. (Running on oeis4.)